Approximation algorithms for cycle packing problems

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2005, Pages 556-561

  Krivelevich, Michael ^a   Nutov, Zeev ^b   Yuster, Raphael ^c  

^a TEL AVIV UNIVERSITY   (Israel)

^b OPEN UNIVERSITY OF ISRAEL   (Israel)

^c UNIVERSITY OF HAIFA   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; GRAPH THEORY; NUMBER THEORY; PROBLEM SOLVING; RELAXATION PROCESSES; SET THEORY; THEOREM PROVING;

APPROXIMATION ALGORITHMS; APPROXIMATION RATIOS; CYCLE PACKING PROBLEMS; GREEDY ALGORITHMS;

ALGORITHMS;

EID: 20744445347     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (10)

1. P. Balister, Packing digraphs with directed closed trails, Combin. Probab. Comput. 12 (2003), 1-15.
2. B. Bollobás, P. Erd̈os, M. Simonovits and E. Szemerédi, Extremal graphs without large forbidden sub-graphs, Ann. Discrete Math. 3 (1978), 29-41.
3. B. Bollobás and A. Thomason, On the girth of Hamiltonian weakly pancyclic graphs, J. Graph Theory 26 (1997), 165-173.
4. A. Caprara, A. Panconesi and R. Rizzi, Packing cycles in undirected graphs, J. Algorithms 48 (2003), 239-256.
5. C. Chekuri and S. Khanna, Edge disjoint paths revisited, Proc. 14th ACM-SIAM SODA (2003), 628-637.
6. D. Dor and M. Tarsi, Graph decomposition is NPC - A complete proof of Holyer's conjecture, Proc. 20th ACM STOC, ACM Press (1992), 252-263.
7. P. Erd̈os and H. Sachs, Reguläre Graphen gegebener Taillenweite mit minimaler Knotenzahl, Wiss. Z. Martin-Luther Univ. Halle-Wittenberg Math.-Natur. Reihe 12 (1963), 251.
8. J. Komlós, Covering odd cycles, Combinatorica 17 (1997), 393-400.
9. P. D. Seymour, Packing directed circuits fractionally, Combinatorica 15 (1995), 281-288.
10. K. Varadarajan and G. Venkataraman, Graph decomposition and a greedy algorithm for edge-disjoint paths, Proc. 15th ACM-SIAM SODA (2004), 372-373.