Computer Science – Data Structures and Algorithms
Scientific paper
2006-09-18
Computer Science
Data Structures and Algorithms
To appear in the Proceedings of the 33rd Workshop on Graph-Theoretic Concepts in Computer Science (WG 2007). Minor changes
Scientific paper
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-eps 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.
No associations
LandOfFree
Minimum-weight Cycle Covers and Their Approximability does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Minimum-weight Cycle Covers and Their Approximability, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Minimum-weight Cycle Covers and Their Approximability will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-647215