Edge disjoint paths revisited

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2003, Pages 628-637

  Chekuri, Chandra ^a   Khanna, Sanjeev ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; LINEAR PROGRAMMING; PROBABILITY; RANDOM PROCESSES; THEOREM PROVING;

DIRECTED GRAPH; EDGE DISJOINT PATHS; UNDIRECTED GRAPH;

ALGORITHMS;

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

References (20)

1. Y. Azar and O. Regev. Strongly polynomial algorithms for the unsplittable flow problem. In Proceedings of 8th IPCO, 2001.
2. A. Baveja and A. Srinivasan. Approximation algorithms for disjoint paths and related routing and packing problems. Mathematics of Operations Research, Vol. 25, pp. 255-280, 2000.
3. J. Cheriyan, H. Karloff, and Y. Rabani. Approximating directed multicuts. In Proceedings of 42nd FOCS, pp. 320-328, 2001.
4. S. Even and R. E. Tarjan. Network flow and testing graph connectivity. SIAM Journal on Computing, Vol. 4, 1975, pp. 507-518.
5. S. Fortune, J. Hopcroft and J. Wyllie. The directed subgraph homeomorphism problem. Theoretical Computer Science, Vol. 10, No. 2 (1980), pp. 111-121.
6. A. Frank, Packing paths, cuts, and circuits - a survey. In B. Korte, L. Lovász, H. J. Prömel, and \A. Schrijver, eds., Paths, Flows and VLSI-Layout, 49-100. Springer Verlag, Berlin, 1990.
7. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, 1979.
8. N. Garg and J. Konemann. Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems. In Proceedings of 39th FOCS, 1998.
9. N. Garg, V. Vazirani and M. Yannakakis. Primaldual approximation algorithms for integral flow and multicut in trees. Algorithmica, 18 (1997), pp. 3-20. (Preliminary verision in Proceedings of 20th International Colloquium on Automata, Languages, and Programming, 1993, pp. 64-75.)
10. 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. In Proceedings of 31st STOC, pp. 19-28, 1999.
11. J. M. Kleinberg. Approximation algorithms for disjoint paths problems. PhD thesis, MIT, Cambridge, MA, May 1996.
12. S. G. Kolliopoulos and C. Stein. Approximating disjoint-path problems using greedy algorithms and Packing Integer Programs. Integer programming and Combinatorial Optimization, 1998.
13. E. L. Lawler. Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston, 1976.
14. T. Leighton, S. Rao, and A. Srinivasan. Multicommodity flow and circuit switching. In Proceedings of the Hawaii International Conference on System Sciences (HICSS), pages 459-465, 1998.
15. B. Ma and L. Wang. On the inapproximability of disjoint paths and minimum steiner forest with bandwidth constraints. Journal of Computer and Systems Sciences, vol 60, pages 1-12, 2000.
16. P. Raghavan and C. D. Thompson. Randomized rounding: A technique for probably good algorithms and algorithmic proofs. Combinatorica, Vol. 7 (1987), pp. 365-374.
17. N. Robertson and P. D. Seymour. Outline of a disjoint paths algorithm. In B. Korte, L. Lovász, H. J. Prömel, and A. Schrijver, Eds., Paths, Flows and VLSI-Layout. Springer-Verlag, Berlin, 1990.
18. A. Schrijver. Theory of Linear and Integer Programming. John Wiley and Sons, 1986.
19. A. Srinivasan. Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems. Proc. of the 38th Symposium on the Foundations of Computer Science, 1997, 1990.
20. D. B. West. Introduction to Graph Theory. Prentice-Hall, Inc., 1996.