Sciweavers

Share
CIAC
2006
Springer

Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments

9 years 6 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-parameter tractability results for these problems. We show that Feedback Vertex Set in tournaments is amenable to the novel iterative compression technique. Moreover, we provide data reductions and problem kernels for Feedback Vertex Set and Feedback Arc Set in tournaments, and a depthbounded search tree for Feedback Arc Set in bipartite tournaments based on a new forbidden subgraph characterization.
Michael Dom, Jiong Guo, Falk Hüffner, Rolf Ni
Added 20 Aug 2010
Updated 20 Aug 2010
Type Conference
Year 2006
Where CIAC
Authors Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier, Anke Truß
Comments (0)
books