Approximability of packing disjoint cycles

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4835 LNCS, Issue , 2007, Pages 304-315

  Friggstad, Zachary ^a   Salavatipour, Mohammad R ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; EDGE DETECTION; PROBLEM SOLVING;

DISJOINT CYCLES; EDGE-DISJOINT CYCLE; GREEDY ALGORITHMS; UNDIRECTED GRAPHS;

GRAPH THEORY;

EID: 38149012984     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-77120-3_28     Document Type: Conference Paper

References (19)

1. Andrews, M., Chuzhoy, J., Khanna, S., Zhang, L.: Hardness of the undirected edge-disjoint paths problem with congestion. In: Proc. of 46th IEEE FOCS, pp. 226-244 (2005)
2. Andrews, M., Zhang, L.: Hardness of the undirected edge-disjoint paths problem. In: Proc. of 37th ACM STOC, pp. 276-283. ACM Press, New York (2005)
3. Balister, P.: Packing digraphs with directed closed trials. Combin. Probab. Comput. 12, 1-15 (2003)
4. Caprara, A., Panconesi, A., Rizzi, R.: Packing cuts in undirected graphs. J. Algorithms 44, 1-11 (1999)
5. Caprara, A., Panconesi, A., Rizzi, R.: Packing cycles in undirected graphs. J. Algorithms 48, 239-256 (2003)
6. Chekuri, C., Khanna, S.: Edge disjoint paths revisited. In: Proc. of 14th ACM-SIAM SODA, pp. 628-637 (2003)
7. Chekuri, C., Khanna, S., Shepherd, B.: An O(√n) Approximation and Integrality Gap for Disjoint Paths and UFP. Theory of Computing 2, 137-146 (2006)
8. Chuzhoy, J., Guha, S., Halperin, E., Khanna, S., Kortsarz, G., Krauthgamer, R., Naor, S.: Tight lower bounds for the asymmetric k-center problem. Journal of ACM 52(4), 538-551 (2005)
9. Chuzhoy, J., Khanna, S.: New hardness results for undirected edge disjoint paths, Manuscript (2005)
10. Dor, D., Tarsi, M.: Graph decomposition is NPC - A complete proof of Holyer's conjecture. In: Proc. of 20th ACM STOC, pp. 252-263. ACM Press, New York (1992)
11. Guruswami, V., Khanna, S., Rajaraman, R., Shepherd, B., Yannakakis, M.: Near-Optimal Hardness Results and Approximation Algorithms for Edge-Disjoint Paths and Related Problems. J. of Computer and System Sciences 67(3), 473-496 (2003) Earlier version in STOC 1999.
12. Halldorsson, M.M., Kortsarz, G., Radhakrishnan, J., Sivasubramanian, S.: Complete Partitions of Graphs. Combinatorica (to appear)
13. Kleinberg, J.: Approximation algorithms for disjoint paths problems, PhD. Thesis, MIT, Cambridge, MA (May 1996)
14. Krivelevich, M., Nutov, Z., Yuster, R.: Approximation algorithms for cycle packing problems. In: Proc. of 16th ACM-SIAM SODA, pp. 556-561 (2005)
15. Krivelevich, M., Nutov, Z., Salavatipour, M.R., Verstraete, J., Yuster, R.: Approximation Algorithms and Hardness Results for Cycle Packing Problems. ACM Transactions on Algorithms (to appear)
16. Salavatipour, M.R., Verstraete, J.: Disjoint cycles: Integrality gap, hardness, and approximation. In: Jünger, M., Kaibel, V. (eds.) Integer Programming and Combinatorial Optimization. LNCS, vol. 3509, pp. 51-65. Springer, Heidelberg (2005)
17. Samorodnitsky, A., Trevisan, L.: A PCP characterization of NP with optimal amortized query complexity. In: Proc. of 32nd ACM STOC, pp. 191-199. ACM Press, New York (2000)
18. Seymour, P.D.: Packing directed circuits fractionally. Combinatorica 15, 281-288 (1995)
19. Varadarajan, K.R., Venkataraman, G.: Graph decomposition and a greedy algorithm for edge-disjoint paths. In: Proc. of 15 ACM-SIAM SODA, pp. 379-380 (2004)