Fixed-parameter tractability results for feedback set problems in tournaments

Authors:
Michael Dom;Jiong Guo;Falk Hüffner;Rolf Niedermeier;Anke Truß
Affiliations:
Institut für Informatik, Friedrich-Schiller-Universität Jena, Jena, Germany;Institut für Informatik, Friedrich-Schiller-Universität Jena, Jena, Germany;Institut für Informatik, Friedrich-Schiller-Universität Jena, Jena, Germany;Institut für Informatik, Friedrich-Schiller-Universität Jena, Jena, Germany;Institut für Informatik, Friedrich-Schiller-Universität Jena, Jena, Germany
Venue:
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Year:
2006

Citing 14
Cited 10

An Approximation Algorithm for Feedback Vertex Sets in Tournaments

SIAM Journal on Computing
An Approximation Algorithm for Feedback Vertex Sets in Tournaments

SIAM Journal on Computing
On Feedback Problems in Diagraphs

WG '89 Proceedings of the 15th International Workshop on Graph-Theoretic Concepts in Computer Science
A Min-Max Theorem on Feedback Vertex Sets

Mathematics of Operations Research
An efficient fixed-parameter algorithm for 3-hitting set

Journal of Discrete Algorithms
Aggregating inconsistent information: ranking and clustering

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)

Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Ranking Tournaments

SIAM Journal on Discrete Mathematics
Parameterized algorithms for feedback set problems and their duals in tournaments

Theoretical Computer Science - Parameterized and exact computation
The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments

Combinatorics, Probability and Computing
An O(2O(k)n3) FPT algorithm for the undirected feedback vertex set problem*

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Improved fixed-parameter algorithms for two feedback set problems

WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Finding odd cycle transversals

Operations Research Letters
Parameterized Complexity

Parameterized Complexity

Feedback arc set in bipartite tournaments is NP-complete

Information Processing Letters
Improved FPT algorithm for feedback vertex set problem in bipartite tournament

Information Processing Letters
A fixed-parameter algorithm for the directed feedback vertex set problem

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Iterative Compression for Exactly Solving NP-Hard Minimization Problems

Algorithmics of Large and Complex Networks
Fast FAST

ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Parameterized algorithms for d-Hitting Set: The weighted case

Theoretical Computer Science
Kernels for feedback arc set in tournaments

Journal of Computer and System Sciences
Conflict packing yields linear vertex-kernels for k-FAST, k-dense RTI and a related problem

MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Kernels: annotated, proper and induced

IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Kernelization --- preprocessing with a guarantee

The Multivariate Algorithmic Revolution and Beyond

Quantified Score

Hi-index	0.00

Visualization

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 depth-bounded search tree for Feedback Arc Set in bipartite tournaments based on a new forbidden subgraph characterization.