Sciweavers

AAAI
2010
13 years 5 months ago
Fast Local Search Algorithm for Weighted Feedback Arc Set in Tournaments
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...
Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman...
CIAC
2006
Springer
111views Algorithms» more  CIAC 2006»
13 years 7 months ago
Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments
Complementing recent progress on classical complexity and polynomial-time approximability of feedback set problems in (bipartite) tournaments, we extend and partially improve fixed...
Michael Dom, Jiong Guo, Falk Hüffner, Rolf Ni...
TAMC
2009
Springer
13 years 10 months ago
Linear Programming Based Approximation Algorithms for Feedback Set Problems in Bipartite Tournaments
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...
Anke van Zuylen
FSTTCS
2009
Springer
13 years 10 months ago
Kernels for Feedback Arc Set In Tournaments
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...
Stéphane Bessy, Fedor V. Fomin, Serge Gaspe...