A Min-Max Theorem on Feedback Vertex Sets
Mathematics of Operations Research
Aggregating inconsistent information: ranking and clustering
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Feedback arc set in bipartite tournaments is NP-complete
Information Processing Letters
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
Deterministic Pivoting Algorithms for Constrained Ranking and Clustering Problems
Mathematics of Operations Research
Feedback arc set problem in bipartite tournaments
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Improved approximation algorithm for the feedback set problem in a bipartite tournament
Operations Research Letters
Uniqueness in Discrete Tomography: Three Remarks and a Corollary
SIAM Journal on Discrete Mathematics
| Hi-index | 0.00 |
We consider the feedback vertex set and feedback arc set problems in 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 we can attain when using a certain linear program as the lower bound on the optimal value. For the feedback arc set problem in bipartite tournaments, we show that a recent 4-approximation algorithm proposed by Gupta [5,6] is incorrect. We give an alternative 4-approximation algorithm based on an algorithm for feedback arc set in (regular) tournaments in [10,11].