Approximation algorithms for disjoint paths and related routing and packing problems

Mathematics of Operations Research

Volumn 25, Issue 2, 2000, Pages 255-280

  Baveja, Alok ^a   Srinivasan, Aravind ^b  

^a RUTGERS UNIVERSITY   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; PROBLEM SOLVING; RELAXATION PROCESSES;

DISJOINT PATHS;

OPERATIONS RESEARCH;

EID: 0034187916     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.25.2.255.12228     Document Type: Article

References (39)

1. Aggarwal A., A. Bar-Noy, D. Coppersmith, R. Ramaswami, B. Schieber, M. Sudan. 1996. Efficient routing in optical networks. J. ACM 46 973-1001.
2. Ahuja, R. K., T. L. Magnanti, J. B. Orlin. 1993. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs, NJ.
3. Arora, S., F. T. Leighton, B. M. Maggs. 1996. On-line algorithms for path selection in a nonblocking network. SIAM J. Comput. 25 600-625.
4. Aumann Y., Y. Rabani. 1995. Improved bounds for all-optical routing. Proc. ACM-SIAM Sympos. Discrete Algorithms. Society for Industrial and Applied Mathematics, San Francisco, CA. 567-576.
5. Awerbuch, B., R. Gawlick, F. T. Leighton, Y. Rabani. 1994. On-line admission control and circuit routing for high performance computing and communication. Proc. IEEE Sympos. Foundations Comput. Sci. IEEE Computer Societry Press, Santa Fe, NM. 412-423.
6. _, F. T. Leighton. Improved approximations for the multi-commodity flow problem and local competitive routing in networks. Proc. ACM Sympos. Theory Comput. ACM, Montreal, Quebec, Canada. 489-496.
7. Boppana, R. B., J. H. Spencer. 1989. A useful elementary correlation inequality. J. Combin. Theory, Ser. A 50 305-307.
8. Borkar, S., R. Cohn, G. Cox, S. Gleason, T. Gross, H. T. Kung, M. Lam, B. Moore, C. Peterson, J. Pieper, L. Rankin, P. S. Tseng, J. Sutton, J. Urbanski, J. Webb. 1988. iWarp, an integrated solution to high-speed parallel computing. Proc. Internat. Sympos. Supercomput. IEEE Computer Society and ACM Sigarch, Orlando, FL. 330-339.
9. Broder, A., A. Frieze, E. Upfal. 1994. Existence and construction of edge-disjoint paths on expander graphs. SIAM J. Comput. 23 976-989.
10. _, _, _. 1999. Static and dynamic path selection on expander graphs: A random walk approach. Random Structure Algorithms 14 87-109.
11. Cole, R. J., B. M. Maggs, R. K. Sitaraman. 1995. Routing on butterfly networks with random faults. Proc. IEEE Sympos. Foundations Comput. Sci. IEEE Computer Society Press, Milwaukee, WI. 558-570.
12. Erdös, P., J. L. Selfridge. 1973. On a combinatorial game. J. Combin. Theory, Ser. A 14 298-301.
13. Fortuin, C. M., J. Ginibre, P. N. Kasteleyn. 1971. Correlational inequalities for partially ordered sets. Comm. Math. Phys. 22 89-103.
14. Guruswami, V., S. Khanna, R. Rajaraman, B. Shepherd, M. Yannakakis. 1999. Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems. Proc. ACM Sympos. Theory Comput. ACM, Atlanta, GA. 19-28.
15. Karp, R. M. 1975. On the computational complexity of combinatorial problems. Networks 5 45-68.
16. Kleinberg, J. 1996. Approximation algorithms for disjoint paths problems. PhD Thesis, Department of EECS, MIT, Cambridge, MA.
17. _, R. Rubinfeld. 1996. Short paths in expander graphs. Proc. IEEE Sympos. Foundations Comput. Sci. IEEE Computer Society Press, Burlington, VT. 86-95.
18. _, É. Tardos. 1995. Disjoint paths in densely embedded networks. Proc. IEEE Sympos. Foundations Comput. Sci. IEEE Computer Society Press, Milwaukee, WI. 52-61.
19. _, _. 1998. Approximations for the disjoint paths problem in high-diameter planar networks. J. Comput. System Sci. 57 61-73.
20. Kolliopoulos, S. G., C. Stein. 1997. Improved approximation algorithms for unsplittable flow problems. Proc. IEEE Sympos. Foundations Comput. Sci. IEEE Computer Society Press, Miami Beach, FL. 426-435.
21. _, _. 1998. Approximating disjoint-path problems using greedy algorithms and packing integer programs. Proc. MPS Conference on Integer Programming and Combinatorial Optimization 153-168, Lecture Notes in Computer Science 1412, Springer-Verlag, Houston, TX.
22. Leighton, F. T. 1992. Introduction to Parallel Algorithms and Architectures: Arrays • Trees • Hypercubes, Morgan Kaufmann, San Mateo, CA.
23. _, B. M. Maggs, S. B. Rao. 1994. Packet routing and jobshop scheduling in O(congestion + dilation) steps. Combinatorica 14 167-186.
24. _, _, A. Richa. 1996. Fast algorithms for finding O(congestion + dilation) packet routing schedules. Technical Report CMU-CS-96-152, School of Computer Science, Carnegie-Mellon University, Pittsburgh, PA.
25. _, S. B. Rao. 1988. An approximate max-flow min-cut theorem for uniform multi-commodity flow problems with applications to approximation algorithms. Proc. IEEE Sympos. Foundations Comput. Sci. IEEE Computer Society Press, White Plains, NY. 422-431.
26. _, _. 1996. Circuit switching: A multi-commodity flow based approach. Proc. Workshop on Randomized Parallel Comput. Honolulu, HI. 11-18.
27. Lin, J. H., J. S. Vitter. 1992. ε-approximations with minimum packing constraint violation. Proc. ACM Sympos. Theory Comput. ACM, Victoria, BC, Canada. 771-782.
28. Motwani, R., J. Naor, P. Raghavan. 1997. Randomized approximation algorithms in combinatorial optimization. D. S. Hochbaum, ed., Approximation Algorithms for NP-Hard Problems. PWS Press, Boston, MA.
29. _, P. Raghavan. 1995. Randomized algorithms. Cambridge University Press, Cambridge, UK.
30. Noakes, M. D., D. A. Wallach, W. J. Dally. 1993. The J-Machine multicomputer: An architectural evaluation. Proc. Ann. Internat. Sympos. Comput. Architecture, ACM, San Diego, CA. 224-235.
31. Peleg, D., E. Upfal. 1989. Disjoint paths on expander graphs. Combinatorica 9 289-313.
32. Rabani, Y. 1996. Path coloring on the mesh. Proc. IEEE Sympos. Foundations Comput. Sci. IEEE Computer Society Press, Burlington, VT. 400-409.
33. Raghavan, P. 1988. Probabilistic construction of deterministic algorithms: Approximating packing integer programs. J. Comput. System Sci. 37 130-143.
34. _, C. D. Thompson. 1987. Randomized rounding: A technique for provably good algorithms and algorithmic proofs. Combinatorica 1 365-374.
35. _, E. Upfal. 1994. Efficient all-optical routing. Proc. ACM Sympos. Theory Comput. ACM, Montreal, Quebec, Canada. 134-143.
36. Spencer, J. H. 1987. Ten Lectures on the Probabilistic Method. SIAM, Philadelphia, PA.
37. Srinivasan, A. 1995. Improved approximations of packing and covering problems. Proc. ACM Sympos. Theory Comput. ACM, Las Vegas, NV. 268-276.
38. _. 1996. An extension of the Lovász Local Lemma, and its applications to integer programming. Proc. ACM-SIAM Sympos. Discrete Algorithms. SIAM, Atlanta, GA, 6-15.
39. Upfal, E. 1992. An O(log N) deterministic packet routing scheme. J. ACM 39 55-70.