Approximating disjoint-path problems using greedy algorithms and packing integer programs

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

Volumn 1412, Issue , 1998, Pages 153-168

  Kolliopoulos, Stavros G ^a   Stein, Clifford ^a  

^a Dartmouth Department of Computer Science_Dartmouth College   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION ALGORITHMS; COMBINATORIAL OPTIMIZATION; COMPUTATIONAL COMPLEXITY; OPTIMIZATION; POLYNOMIAL APPROXIMATION;

BIN PACKING; DISJOINT PATHS; GREEDY ALGORITHMS; PACKING INTEGER PROGRAMS; PERFORMANCE GUARANTEES; POLYNOMIAL TIME APPROXIMATION ALGORITHMS; UNSPLITTABLE FLOW; VERTEX DISJOINT PATHS;

INTEGER PROGRAMMING;

EID: 84958746330     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-69346-7_12     Document Type: Conference Paper

References (34)

1. R. Aharoni, P. Erdös, and N. Linial. Optima of dual integer linear programs. Comb., 8:13-20, 1988
2. Y. Aumann and Y. Rabani. Improved bounds for all-optical routing. In Proc. 6th ACM-SIAM Symp. on Discrete Algorithms, pages 567-576, 1995
3. A. Z. Broder, A. M. Frieze, and E. Upfal. Static and dynamic path selection on expander graphs: a random walk approach. In Proc. 29th Ann. ACM Symp. on Theory of Computing, 531-539, 1997
4. C. Cooper. The thresold of hamilton cycles in the square of a random graph. Random Structures and Algorithms, 5:25-31, 1994
5. H. Fleischner. The square of every two-connected graph is hamiltonian. J. of Combinatorial Theory B, 16:29-34, 1974
6. A. Frank. Packing paths, cuts and circuits - A survey. In B. Korte, L. Lovász, H. J. Prömel, and A. Schrijver, editors, Paths, Flows and VLSI-Layout, pages 49-100. Springer-Verlag, Berlin, 1990
7. N. Garg, V. Vazirani, and M. Yannakakis. Primal-dual approximation algorithms for integral flow and multicut in trees. Algorithmica, 18:3-20, 1997
8. R. M. Karp, F. T. Leighton, R. L. Rivest, C. D. Thompson, U. V. Vazirani, and V. V. Vazirani. Global wire routing in two-dimensional arrays. Algorithmica, 2:113-129, 1987
9. R. M. Karp. On the computational complexity of combinatorial problems. Net- works, 5:45-68, 1975
10. J. M. Kleinberg. Approximation algorithms for disjoint paths problems. PhD thesis, MIT, Cambridge, MA, May 1996
11. J. M. Kleinberg. Single-source unsplittable flow. In Proc. 37th Ann. Symp. on Foundations of Computer Science, pages 68-77, October 1996
12. J. M. Kleinberg and R. Rubinfeld. Short paths in expander graphs. In Proc. 37th Ann. Symp. on Foundations of Computer Science, pages 86-95, 1996
13. J. M. Kleinberg and É. Tardos. Disjoint paths in densely-embedded graphs. In Proc. 36th Ann. Symp. on Foundations of Computer Science, pages 52-61, 1995
14. S. G. Kolliopoulos and C. Stein. Improved approximation algorithms for unsplittable flow problems. In Proc. 38th Ann. Symp. on Foundations of Computer Sci- ence, pages 426-435, 1997
15. S. G. Kolliopoulos and C. Stein. Approximating disjoint-path problems using greedy algorithms and packing integer programs. Technical Report PCS TR97- 325, Department of Computer Science, Dartmouth College, 1997
16. F. T. Leighton and S. B. Rao. Circuit switching: A multi-commodity flow approach. In Workshop on Randomized Parallel Computing, 1996
17. T. Leighton and S. Rao. An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. In Proc. 29th Ann. Symp. on Foundations of Computer Science, pages 422-431, 1988
18. Y.-L. Lin and S. E. Skiena. Algorithms for square roots of graphs. SIAM J. on Discrete Mathematics, 8(1):99-118, 1995
19. L. Lovász. On the ratio of optimal and fractional covers. Discrete Mathematics, 13:383-390, 1975
20. P. Martin and D. B. Shmoys. A new approach to computing optimal schedules for the job-shop scheduling problem. In Proc. 5th Conference on Integer Programming and Combinatorial Optimization, pages 389-403, 1996
21. D. Peleg and E. Upfal. Disjoint paths on expander graphs. Comb., 9:289-313, 1989
22. S. Plotkin. Competitive routing of virtual circuits in ATM networks. IEEE J. Selected Areas in Comm., 1128-1136, 1995
23. S. Plotkin, D. B. Shmoys, and E. Tardos. Fast approximation algorithms for fractional packing and covering problems. Math. of Oper. Res., 20:257-301, 1995
24. P. Raghavan. Probabilistic construction of deterministic algorithms: approximating packing integer programs. J. of Computer and System Sciences, 37:130-143, 1988
25. P. Raghavan and C. D. Thompson. Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Comb., 7:365-374, 1987
26. 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, editors, Paths, Flows and VLSI- Layout. Springer-Verlag, Berlin, 1990
27. A. Schrijver. Homotopic routing methods. In B. Korte, L. Lovász, H. J. Prömel, and A. Schrijver, editors, Paths, Flows and VLSI-Layout. Springer, Berlin, 1990
28. D. B. Shmoys, C. Stein, and J. Wein. Improved approximation algorithms for shop scheduling problems. SIAM J. on Computing, 23(3):617-632, 1994
29. A. Srinivasan. Improved approximations of packing and covering problems. In Proc. 27th Ann. ACM Symp. on Theory of Computing, pages 268-276, 1995
30. A. Srinivasan. An extension of the Lovász Local Lemma and its applications to integer programming. In Proc. 7th ACM-SIAM Symp. on Discrete Algorithms, pages 6-15, 1996
31. A. Srinivasan. Improved approximations for edge-disjoint paths, unsplittable flow and related routing problems. In Proc. 38th Ann. Symp. on Foundations of Computer Science, pages 416-425, 1997
32. A. Srinivasan and C.-P. Teo. A constant-factor approximation algorithm for packet routing and balancing local vs. global criteria. In Proc. 29th Ann. ACM Symp. on Theory of Computing, pages 636-643, 1997
33. C. Stein. Approximation Algorithms for Multicommodity Flow and Shop Scheduling Problems. PhD thesis, MIT, Cambridge, MA, August 1992
34. P. Underground. On graphs with hamiltonian squares. Disc. Math., 21:323, 1978.