12 search results - page 1 / 3 » Fast Local Search Algorithm for Weighted Feedback Arc Set in... |
119
Voted
AAAI
2010
15 years 3 months ago
2010
We present a fast local search algorithm that finds an improved solution (if there is any) in the k-exchange neighborhood of the given solution to an instance of WEIGHTED FEEDBACK...
118
click to vote
CIAC
2006
Springer
15 years 5 months ago
2006
Springer
Complementing recent progress on classical complexity and polynomial-time approximability of feedback set problems in (bipartite) tournaments, we extend and partially improve fixed...
128
click to vote
FSTTCS
2009
Springer
15 years 8 months ago
2009
Springer
A tournament T = (V, A) is a directed graph in which there is exactly one arc between every pair of distinct vertices. Given a digraph on n vertices and an integer parameter k, th...
135
click to vote
STOC
2007
ACM
16 years 1 months ago
2007
ACM
We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted generalization gives a PTAS for KemenyYoung ran...
119
click to vote
ICALP
2009
Springer
16 years 1 months ago
2009
Springer
We present a randomized subexponential time, polynomial space parameterized algorithm for the k-Weighted Feedback Arc Set in Tournaments (k-FAST) problem. We also show that our alg...