Cycle cover with short cycles

Lecture Notes in Computer Science

Volumn 3404, Issue , 2005, Pages 641-653

  Immorlica, Nicole ^a   Mahdian, Mohammad ^a   Mirrokni, Vahab S ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; NONLINEAR SYSTEMS;

APPROXIMATION ALGORITHMS; CYCLE COVERING; DUAL-FITTING ALGORITHM;

COMPUTER SCIENCE;

EID: 24144471489     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31856-9_53     Document Type: Conference Paper

References (20)

1. M. Blaser and B. Siebert. Computing cycle covers without short cycles. In Proceedings of the 34st Annual European Symposium of Algorithms, 2001.
2. J. Edmonds and E. Johnson. Matching euler tours and the Chinese postman problem. Mathematical programming, 5:88-124, 1973.
3. Ozlem Ergun, Gultekin Kuyzu, and Martin Savelsbergh. Collaborative logistics: The shipper collaboration problem, submitted to Computers and Operations Research Odysseus 2003 Special Issue, 2003.
4. Ozlem Ergun, Gultekin Kuyzu, and Martin Savelsbergh. The lane covering problem, manuscript, 2003.
5. U. Feige. A threshold of ln n for approximating set cover. Journal of the ACM, 45:634-652, 1998.
6. M. R. Garey and D.S. Johnson. Computers and Intractability. W. H. Freeman and Company, 1979.
7. O. Goldschmidt, D. Hochbaum, C. Hurkens, and G. Yu. Approximation algorithms for the k-clique covering problem. SIAM Journal of Discrete Math., 9(3):492-509, 1996.
8. M. Guan. Graphic programming using odd and even points. Chinese Mathematics, 1:273-277, 1962.
9. D. Hochbaum and E. Olinick. The bounded cycle-cover problem. INFORMS Journal on Computing, 13(2):104-119, 2001.
10. Holyer. The np-completeness of some edge partitioning problems. SIAM journal of Computing, 10:713-717, 1981.
11. A. Itai, R.J. Lipton, C.H. Papadimitriou, and M. Rodeh. Covering graphs by simple circuits. SIAM Journal on Computing, 10:746-750, 1981.
12. K. Jain, M. Mahdian, E. Markakis, A. Saberi, and V. Vazirani. Greedy facility location algorithms analyzed using dual fitting with factor-revealing lp. Journal of the ACM, 50(6):795-824, November 2003.
13. J. Kennington, V. Nair, and M. Rahman. Optimization based algorithms for finding minimal cost ring covers in survivable networks. Computational Optimization and Applications, 14(2):219-230, 1999.
14. F. Lazebnik and V.A. Ustimenko. Explicit construction of graphs with arbitrary large girth and of large size. Discrete Applied Mathematics, 60:275-284, 1995.
15. Christos H. Papadimitriou. On the complexity of edge traversing. Journal of the ACM, 23(3):544-554, 1976.
16. B. Rachavachari and J. Veerasamy. A 3/2-approximation algorithm for the mixed postman problem. SIAM journal of Disc. Math., 12:425-433, 1999.
17. J.B. Slevinsky, W.D. Grover, and M.H. MacGregor'. An algorithm for survivable network design employing multiple self-healing rings. In GLOBECOM '93, pages 1568-1573, 1993.
18. C. Thomassen. On the complexity of finding a minimum cycle cover of a graph. SIAM journal of computing, 26:675-6777, 1997.
19. V. V. Vazirani. Approximation Algorithms. Springer-Verlag, Berlin, 2001.
20. C.Q. Zhang. Integer flows and cycle cover of graphs. Marcel Dekker, Inc, 1997.