Feedback arc set problem in bipartite tournaments

Authors:
Sushmita Gupta
Affiliations:
School of Computing Science, Simon Fraser University, Canada
Venue:
Information Processing Letters
Year:
2008

Citing 7
Cited 7

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
Ranking Tournaments

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
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
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
The Left and Right Context of a Word: Overlapping Chinese Syllable Word Segmentation with Minimal Context

ACM Transactions on Asian Language Information Processing (TALIP)
A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments

Theory of Computing Systems

Quantified Score

Hi-index	0.89

Visualization

Abstract

In this paper we give ratio 4 deterministic and randomized approximation algorithms for the 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.