Faster FAST(Feedback Arc Set in Tournaments)

TL;DR

This paper introduces a new algorithm for the Feedback Arc Set problem in tournaments that significantly improves the running time, making it faster than previous methods for certain parameter ranges.

Contribution

The authors develop an algorithm with a runtime of n^{O(1)}2^{O(√k)} for finding feedback arc sets in tournaments, improving over prior algorithms.

Findings

The new algorithm is asymptotically faster than previous solutions.

It achieves a runtime of n^{O(1)}2^{O(√k)} for the problem.

This advancement enhances the efficiency of solving feedback arc set problems in tournaments.

Abstract

We present an algorithm that finds a feedback arc set of size $k$ in a tournament in time $n^{O(1)}2^{O(\sqrt{k})}$. This is asymptotically faster than the running time of previously known algorithms for this problem.