Abstract
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. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Dom, M., Guo, J., Hüffner, F., Niedermeier, R., & Truß, A. (2006). Fixed-parameter tractability results for feedback set problems in tournaments. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3998 LNCS, pp. 320–331). Springer Verlag. https://doi.org/10.1007/11758471_31
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
