AAAI
2010
14 years 29 days 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...
CIAC
2006
Springer
14 years 3 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...
TAMC
2009
Springer
2009
Springer
Linear Programming Based Approximation Algorithms for Feedback Set Problems in Bipartite Tournaments
14 years 6 months ago
We consider the feedback vertex set and feedback arc set problems in bipartite tournaments. We improve on recent results by giving a 2-approximation algorithm for the feedback vert...
FSTTCS
2009
Springer
14 years 6 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...