Minimum-Weight Cycle Covers and Their Approximability
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set L ⊆ ℕ.
We investigate how well L-cycle covers of minimum weight can be approximated. For undirected graphs, we devise a polynomial-time approximation algorithm that achieves a constant approximation ratio for all sets L. On the other hand, we prove that the problem cannot be approximated within a factor of 2 − ε for certain sets L.
For directed graphs, we present a polynomial-time approximation algorithm that achieves an approximation ratio of O(n), where n is the number of vertices. This is asymptotically optimal: We show that the problem cannot be approximated within a factor of o(n).
To contrast the results for cycle covers of minimum weight, we show that the problem of computing L-cycle covers of maximum weight can, at least in principle, be approximated arbitrarily well.
KeywordsApproximation Algorithm Undirected Graph Approximation Ratio Edge Weight Minimum Weight
Unable to display preview. Download preview PDF.
- 1.Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs (1993)Google Scholar
- 2.Bläser, M.: A 3/4-approximation algorithm for maximum ATSP with weights zero and one. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) RANDOM 2004 and APPROX 2004. LNCS, vol. 3122, pp. 61–71. Springer, Heidelberg (2004)Google Scholar
- 5.Bläser, M., Shankar Ram, L., Sviridenko, M.I.: Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems. In: Dehne, F., López-Ortiz, A., Sack, J.-R. (eds.) WADS 2005. LNCS, vol. 3608, pp. 350–359. Springer, Heidelberg (2005)Google Scholar
- 12.Hartvigsen, D.: An Extension of Matching Theory. PhD thesis, Department of Mathematics, Carnegie Mellon University, Pittsburgh, Pennsylvania, USA (September 1984)Google Scholar
- 20.Manthey, B.: On approximating restricted cycle covers. Report 07-011, Electronic Colloquium on Computational Complexity (ECCC) (2007)Google Scholar
- 25.Vornberger, O.: Easy and hard cycle covers. Technical report, Universität/Gesamthochschule Paderborn (1980)Google Scholar