Journal of Combinatorial Theory Series B
Local ratio: A unified framework for approximation algorithms. In Memoriam: Shimon Even 1935-2004
ACM Computing Surveys (CSUR)
Aggregating inconsistent information: ranking and clustering
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Improved FPT algorithm for feedback vertex set problem in bipartite tournament
Information Processing Letters
Aggregating inconsistent information: Ranking and clustering
Journal of the ACM (JACM)
Fixed-parameter tractability results for feedback set problems in tournaments
Journal of Discrete Algorithms
Linear programming based approximation algorithms for feedback set problems in bipartite tournaments
Theoretical Computer Science
Two hardness results on feedback vertex sets
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Tractable feedback vertex sets in restricted bipartite graphs
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Largest induced acyclic tournament in random digraphs: a 2-point concentration
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Fixed-parameter tractability results for feedback set problems in tournaments
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
An efficient algorithm for finding maximum cycle packings in reducible flow graphs
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Packing cycles exactly in polynomial time
Journal of Combinatorial Optimization
Fixed-parameter complexity of feedback vertex set in bipartite tournaments
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Feedback vertex sets on restricted bipartite graphs
Theoretical Computer Science
| Hi-index | 0.00 |
We obtain a necessary and sufficient condition in terms of forbidden structures for tournaments to possess the min-max relation on packing and covering directed cycles, together with strongly polynomial time algorithms for the feedback vertex set problem and the cycle packing problem in this class of tournaments. Applying the local ratio technique of Bar-Yehuda and Even to the forbidden structures, we find a 2.5-approximation polynomial time algorithm for the feedback vertex set problem in any tournament.