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
A Min-Max Theorem on Feedback Vertex Sets
Mathematics of Operations Research
Feedback arc set in bipartite tournaments is NP-complete
Information Processing Letters
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Deterministic pivoting algorithms for constrained ranking and clustering problems
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Feedback arc set problem in bipartite tournaments
Information Processing Letters
Aggregating inconsistent information: Ranking and clustering
Journal of the ACM (JACM)
Computing slater rankings using similarities among candidates
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Deterministic Pivoting Algorithms for Constrained Ranking and Clustering Problems
Mathematics of Operations Research
Improved approximation algorithm for the feedback set problem in a bipartite tournament
Operations Research Letters
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
A polynomial kernel for feedback arc set on bipartite tournaments
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
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
A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments
Theory of Computing Systems
| Hi-index | 5.23 |
We consider the feedback vertex set and feedback arc set problems on bipartite tournaments. We improve on recent results by giving a 2-approximation algorithm for the feedback vertex set problem. We show that this result is the best that we can attain when using optimal solutions to a certain linear program as a lower bound on the optimal value. For the feedback arc set problem on bipartite tournaments, we show that a recent 4-approximation algorithm proposed by Gupta (2008) [8] is incorrect. We give an alternative 4-approximation algorithm based on an algorithm for the feedback arc set on (non-bipartite) tournaments given by van Zuylen and Williamson (2009) [14].