Faster FAST(Feedback Arc Set in Tournaments)

Details Faster FAST(Feedback Arc Set in Tournaments) Faster FAST(Feedback Arc Set in Tournaments)

2009-11-26

arxiv.org/abs/0911.5094v1

Computer Science

Data Structures and Algorithms

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Faster FAST(Feedback Arc Set in Tournaments) does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Faster FAST(Feedback Arc Set in Tournaments), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Faster FAST(Feedback Arc Set in Tournaments) will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-116800