Abstract
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].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ailon, N., Charikar, M., Newman, A.: Aggregating inconsistent information: ranking and clustering. In: STOC 2005: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, pp. 684–693 (2005)
Cai, M.-C., Deng, X., Zang, W.: A min-max theorem on feedback vertex sets. Math. Oper. Res. 27, 361–371 (2002)
Even, G., Naor, J., Schieber, B., Sudan, M.: Approximating minimum feedback sets and multicuts in directed graphs. Algorithmica 20(2), 151–174 (1998)
Guo, J., Hüffner, F., Moser, H.: Feedback arc set in bipartite tournaments is NP-complete. Inf. Process. Lett. 102(2-3), 62–65 (2007)
Gupta, S.: Feedback arc set problem in bipartite tournaments. In: Cai, J.-Y., Cooper, S.B., Zhu, H. (eds.) TAMC 2007. LNCS, vol. 4484, pp. 354–361. Springer, Heidelberg (2007)
Gupta, S.: Feedback arc set problem in bipartite tournaments. Inf. Process. Lett. 105(4), 150–154 (2008)
Kann, V.: On the approximability of NP-complete optimization problems, Ph.D. thesis, Department of Numerical Analysis and Computing Science, Royal Institute of Technology, Stockholm (1992)
Sasatte, P.: Improved approximation algorithm for the feedback set problem in a bipartite tournament. Operations Research Letters 36(5), 602–604 (2008)
Seymour, P.D.: Packing directed circuits fractionally. Combinatorica 15(2), 281–288 (1995)
van Zuylen, A., Hegde, R., Jain, K., Williamson, D.P.: Deterministic pivoting algorithms for constrained ranking and clustering problems. In: SODA 2007: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 405–414 (2007)
van Zuylen, A., Williamson, D.P.: Deterministic pivoting algorithms for constrained ranking and clustering problems. Math. Oper. Res. (to appear), http://www.itcs.tsinghua.edu.cn/~anke/MOR.pdf
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
van Zuylen, A. (2009). Linear Programming Based Approximation Algorithms for Feedback Set Problems in Bipartite Tournaments. In: Chen, J., Cooper, S.B. (eds) Theory and Applications of Models of Computation. TAMC 2009. Lecture Notes in Computer Science, vol 5532. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02017-9_39
Download citation
DOI: https://doi.org/10.1007/978-3-642-02017-9_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02016-2
Online ISBN: 978-3-642-02017-9
eBook Packages: Computer ScienceComputer Science (R0)