English

Faster FAST(Feedback Arc Set in Tournaments)

Data Structures and Algorithms 2009-11-30 v1

Abstract

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

Cite

@article{arxiv.0911.5094,
  title  = {Faster FAST(Feedback Arc Set in Tournaments)},
  author = {Uriel Feige},
  journal= {arXiv preprint arXiv:0911.5094},
  year   = {2009}
}
R2 v1 2026-06-21T14:16:28.978Z