Edge-disjoint paths revisited

ACM Transactions on Algorithms

Volumn 3, Issue 4, 2007, Pages

  Chekuri, Chandra ^a,c   Khanna, Sanjeev ^b,d  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

^c University of Illinois at Urbana Champaign   (United States)

^d UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

Approximation algorithm; Edge disjoint paths; Greedy algorithm; Multicommodity flow relaxation

Indexed keywords

EDGE-DISJOINT PATHS; GREEDY ALGORITHMS; MULTICOMMODITY FLOW RELAXATION; UNIFORM CAPACITY UNSPLITTABLE FLOW PROBLEM (UCUFP);

GRAPH THEORY; NUMBER THEORY; PROBLEM SOLVING;

APPROXIMATION ALGORITHMS;

EID: 36448936789     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1290672.1290683     Document Type: Conference Paper

References (25)

1. AZAR, Y., AND REGEV, O. 2006. Combinatorial algorithms for the unsplittable flow problem. Algorithmica 44, 1, 49-66.
2. BAVEJA, A., AND SRINIVASAN, A. 2000. Approximation algorithms for disjoint paths and related routing and packing problems. Math. Oper. Res. 25, 2, 255-280.
3. CHEKURI, C., KHANNA, S., AND SHEPHERD, F. B. 2006. An O(√n) Approximation and integrality gap for disjoint paths and unsplittable flow. Theory Comput. 2,7, 137-146.
4. CHERIYAN, J., KARLOFF, H. J., AND RABANI, Y. 2005. Approximating directed multicuts. Combinatorica 25, 3, 251-269.
5. EVEN, S., AND TARJAN, R. 1975. Network flow and testing graph connectivity. SIAM J. Comput. 4, 507-518.
6. FORTUNE, S., HOPCROFT, J., AND WYLLIE, J. 1980. The directed subgraph homeomorphism. problem. Theor. Comput. Sci. 10, 2, 111-121.
7. FRANK, A. 1990. Packing paths, cuts, and circuits - A survey. In Paths, Flows and VLSI-Layout, B. Korte et al., eds., Springer, 49-100.
8. GAREY, M. R. AND JOHNSON, D. S. 1979. Computers and Intractability: A Guide to the Theory of NP-completeness. W. H. Freeman, New York.
9. GARG, N., AND KÖNEMANN, J. 1998. Faster and simpler algorithms for multicommodity flow and other fractional packing problems. In Proceedings of the Annual Symposium on Foundations of Computer Science (FOCS), 300-309.
10. GARG, N., VAZIRANI, V. V., AND YANNAKAKIS, M. 1997. Primal-Dual approximation algorithms for integral flow and multicut in trees. Algorithmica, 18, 3-20.
11. GURUSWAMI, V., KHANNA, S., RAJARAMAN, R., SHEPHERD, F. B., AND YANNAKAKIS, M. 2003. Near-Optimal hardness results and approximation algorithms for edge-disjoint paths and related problems. J. Comput. Syst. Sci. 67, 3, 473-496.
12. KLEINBERG, J. 1996. Approximation algorithms for disjoint paths problems. PhD thesis, MIT.
13. KOLLIOPOULOS, S. 1998. Exact and approximation algorithms for disjoint-path problems. PhD thesis, Dartmouth College.
14. KOLLIOPOULOS, S. G., AND STEIN, C 2004. Approximating disjoint-path problems using packing integer programs. Math. Program. Ser. A 99, 63-87.
15. KOLMAN, P. 2003. A note on the greedy algorithm for the unsplittable flow problem. Inf. Process. Lett. 88, 3, 101-105.
16. LAWLER, E. 1976. Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston, Austin, TX.
17. MA, B., AND WANG, L. 2000. On the inapproximability of disjoint paths and minimum Steiner forest with bandwidth constraints. J. Comput. Syst. Sci. 60, 1, 11-12.
18. MOTWANI, R., AND RAGHAVAN, P. 1995. Randomized Algorithms. Cambridge University Press, New York.
19. RAGHAVAN, P. 1988. Probabilistic construction of deterministic algorithms: Approximating packing integer programs. J. Comput. Syst. Sci. 37, 2, 130-143.
20. RAGHAVAN, P., AND THOMPSON, C D. 1987. Randomized rounding: A technique for provably good algorithms and algorithmic proofs. Combinatorica 7, 365-374
21. ROBERTSON, N., AND SEYMOUR, P. 1990. Outline of a disjoint paths algorithm. In Paths, Flows and VLSI-Layout, B. Korte et al., eds. Springer.
22. SCHRDVER, A. 1986. Theory of Linear and Integer Programming. John Wiley, New York.
23. SRINIVASAN, A. 1997. Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems. In Proceedings of the 38th Annual Sympossium on Foundations of Computer Science (FOCS). IEEE Computer Society, Washington, DC, 416.
24. VARADARAJAN, K., AND VENKATARAMAN, G. 2004. Graph decomposition and a greedy algorithm for edge-disjoint paths. In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Society for Industrial and Applied Mathematics, Philadelphia, PA, 379-380.
25. WEST, D. B. 1996. Introduction to Graph Theory. Prentice-Hall.