Improved approximation algorithm for the feedback set problem in a bipartite tournament

Authors:
Prashant Sasatte
Affiliations:
Department of Computer Science, University of Waterloo, Ontario, Canada
Venue:
Operations Research Letters
Year:
2008

Citing 2
Cited 7

A Min-Max Theorem on Feedback Vertex Sets

Mathematics of Operations Research
A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a simple 3-approximation algorithm for the feedback vertex set problem in a bipartite tournament, improving on the approximation ratio of 3.5 achieved by the best previous algorithms.