Graph Decomposition and a Greedy Algorithm for Edge-disjoint Paths

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 15, Issue , 2004, Pages 372-373

  Varadarajan, Kasturi ^a   Venkataraman, Ganesh ^a  

^a UNIVERSITY OF IOWA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EDGE-DISJOINT PATHS (EDP); GRAPH DECOMPOSITION; GREEDY ALGORITHM;

ALGORITHMS; APPROXIMATION THEORY; MATHEMATICAL TECHNIQUES; PROBLEM SOLVING; THEOREM PROVING;

GRAPH THEORY;

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

References (5)

1. Chandra Chekuri and Sanjeev Khanna. Edge Disjoint Paths Revisited. In Proc. Symp. On Disc. Algorithms, 2003, pp. 628-637.
2. V. Guruswami, S. Khanna, B. Shepherd, R. Rajaraman and M. Yannakakis. Near-Optimal Hardness Results and Approximation Algorithms for Edge-Disjoint Paths and Related Problems. Proceedings of 31st STOC, 1999, pp. 19-28.
3. J. M. Kleinberg. Approximation algorithms for disjoint paths problems. PhD thesis, MIT, Cambridge, MA, May 1996.
4. S. G. Kolliopoulos and C. Stein. Approximating disjoint-paths problem using greedy algorithms and Packing Integer Programs. IPCO, 1998, pp. 153-168.
5. A.Srinivasan. Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems. Proceedings of the 38th Symp. on Foundations of Comp. Sci., 1997, pp. 416-425.