Faster FAST(Feedback Arc Set in Tournaments)
Abstract
We present an algorithm that finds a feedback arc set of size k in a tournament in time nO(1)2O(k). This is asymptotically faster than the running time of previously known algorithms for this problem.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.