Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

STACS

2005

Springer

2005

Springer

Cycle covering is a well-studied problem in computer science. In this paper, we develop approximation algorithms for variants of cycle covering problems which bound the size and/or length of the covering cycles. In particular, we give a ´½ · ÐÒ¾µ-approximation for the lane covering problem [4, 5] in weighted graphs with metric lengths on the edges and an Ç´ÐÒ µ approximation for the bounded cycle cover problem [11] with cycle-size bound in uniform graphs. Our techniques are based on interpreting a greedy algorithm (proposed and empirically evaluated by Ergun et al. [4, 5]) as a dual-ﬁtting algorithm. We then ﬁnd the approximation factor by bounding the solution of a factor-revealing non-linear program. These are the ﬁrst non-trivial approximation algorithms for these problems. We show that our analysis is tight for the greedy algorithm, and change the process of the dual-ﬁtting algorithm to improve the factor for small cycle bounds. Finally, we prove that variants ...

Related Content

Added |
28 Jun 2010 |

Updated |
28 Jun 2010 |

Type |
Conference |

Year |
2005 |

Where |
STACS |

Authors |
Nicole Immorlica, Mohammad Mahdian, Vahab S. Mirrokni |

Comments (0)