Approximately covering by cycles in planar graphs

Authors:
Dieter Rautenbach;Bruce Reed
Affiliations:
Equipe Combinatoire, Université Paris 6, 175 rue du Chevaleret, 75013 Paris, France;Equipe Combinatoire, Université Paris 6, 175 rue du Chevaleret, 75013 Paris, France
Venue:
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Year:
2001

Citing 3
Cited 0

Approximation algorithms

Approximation algorithms
Covering a Graph by Circuits

Proceedings of the Fifth Colloquium on Automata, Languages and Programming
A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Let G = (V(G), E(G)) be a graph and let C be the collection of its cycles. Let p: E(G) ↣ Z+&Ogr;? be a non-negative, integer-valued function on its edge set.The CYCLE COVER PROBLEM is the optimization problem of finding a multiset a of cycles of G such that each edge e ∈ E is in at least p(e) of the cycles in a and such that the sum of the lengths of all cycles in a is minimum.We will show how to approximate within a factor of 8 the optimum value of the cycle cover problem for planar graphs in polynomial time.