Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Journal of the ACM (JACM)
On Feedback Problems in Diagraphs
WG '89 Proceedings of the 15th International Workshop on Graph-Theoretic Concepts in Computer Science
Aggregating inconsistent information: ranking and clustering
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Ordering by weighted number of wins gives a good ranking for weighted tournaments
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
SIAM Journal on Discrete Mathematics
The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments
Combinatorics, Probability and Computing
Feedback arc set in bipartite tournaments is NP-complete
Information Processing Letters
Linear Programming Based Approximation Algorithms for Feedback Set Problems in Bipartite Tournaments
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Hi-index | 0.00 |
In this paper we give ratio 4 deterministic and randomized approximation algorithms for Feedback Arc Set problem in bipartite tournaments. We also generalize these results to give a factor 4 deterministic approximation algorithm for Feedback Arc Set problem in multipartite tournaments.