Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms

Journal of the ACM

Volumn 46, Issue 6, 1999, Pages 787-832

  Leighton, Tom ^a,b   Rao, Satish ^c,d  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b NEC LABORATORIES AMERICA   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^d UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Approximation algorithms; Divide and conquer; Graph bisection; Graph partitioning; Maximum flow; Minimum cut; Muticommodity flow; Routing; Vlsi layout

Indexed keywords

APPROXIMATION ALGORITHMS; GRAPH BISECTION; GRAPH PARTITIONING;

APPROXIMATION THEORY; FEEDBACK; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING; ROUTERS; THEOREM PROVING;

ALGORITHMS;

EID: 0000651166     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/331524.331526     Document Type: Article

References (80)

1. AGRAWAL, A., KLEIN, P. N., AND RAVI, R. 1993. Cutting down on fill using nested dissection: Provably good elimination orderings. In Graph Theory and Sparse Matrix Computation, A. George,
2. J. Gilbert, and J. W. H. Liu, cds. IMA Volumes in Mathematics and Its Applications, SpringerVerlag, New York, pp. 31-55.
3. ARORA, S., KARGER, D., AND KARPINSKI, M. 1995. Polynomial time approximation schemes for dense instances of NP-hard problems. In Proceedings of the 27th Annual ACM Symposium on Theory of Computing (Las Vegas, Nev., May 29-June 1). ACM, New York, pp. 284-293.
4. AUMANN, Y. AND RABANi, Y. 1995. Improved bounds for all-optical routing. In Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms (San Francisco, Calif., Jan. 22-24), ACM, New York, pp. 567-576.
5. AUMANN, Y. AND RABANI, Y. 1998. An O(log k) approximate min-cut max-flow theorem and approximation algorithm. SLAM J. Compiit. 27, 1, 291-301.
6. AWERBUCH, B., BERGER, B., COWEN, L., AND PELEG, D. 1999. Near-linear cost constructions of neighborhood covers in sequential and distributed environments. SLAM J. Compiit. 28, 1, 263-277.
7. AWERBUCH, B. AND LEIGHTON, T. 1994. Improved approximation algorithms for the multicommodity flow problem and local competitive routing in dynamic networks. In Proceedings of the 26th Annual ACM Symposium on Theory of Computing (Montreal, Que., Canada, May 23-25). ACM, New York, pp. 487-495.
8. AWERBUCH, B. AND PELEG, D. 1990. Sparse partitions. In Proceedings of the 31st Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., pp. 503-513.
9. BENCZUR, A. AND KARGER, D. 1996. Approximate s-t min-cuts in 0(/i2) time. In Proceedings of the 28th Annual ACM Symposium on Theory of Computing (Philadelphia, Pa., May 22-24). ACM, New York, pp. 47-55.
10. BHATT, S. N. AND LEIGHTON, F. T. 1984. A framework for solving VLSI graph layout problems. J. Compiit. Syst. Sei. 28, 2, 300-343.
11. BODLAENDER, H., HAFSTEINSSON, H., GILBERT, J. R., AND KLOKS, T. 1995. Approximating treewidth, pathwidth, frontsize, and shortest elimination tree. J. Algorithms 18, 238-255.
12. BOURGAIN, J. 1985. On Lipschitz embedding of finite metric spaces in Hubert space. Is. J. Math. 52, 46-52.
13. BRODER, A. Z., FRIEZE, A. M., AND UPFAL, E. 1992. Existence and construction of edge disjoint paths on expander graphs. In Proceedings of the 24th Annual ACM Symposium on Theory of Computing (Victoria, B.C., Canada, May 4-6). ACM, New York, pp. 140-149.
14. BRODER, A. Z., FRIEZE, A. M., AND UPFAL, E. 1997. Static and dynamic path selection on expander graphs: A random walk approach. In Proceedings of the 29th Annual ACM Symposium on the Theory of Computing (El Paso, Tex., May 4-6), ACM, New York, pp. 531-539.
15. CHUNG, F. K., COFFMAN, E. G., REIMAN, M. I., AND SIMON, B. E. 1987. The forwarding index of communication networks. IEEE Trans. Inf. Theory 33, 224-232.
16. CIIVATAL, V. 1983. Linear Programming. Freeman, San Francisco, Calif.
17. COHEN, E. 1993. Fast algorithms for constructing /-spanners and paths with stretch t. In Proceedings of the 34th Annual Symposium on Foundations of Computer Science (Nov.), IEEE Computer Society Press, Los Alamitos, Calif., pp. 648-658.
18. DIACONIS, P. AND STROOCK, D. 1991. Geometric bounds for eigenvalues of Markov chains. Ann. Appl. Prob, l, 36-61.
19. DOLEV, D., LEIGHTON, F. T., AND TRICKEY, H. 1983. Planar embeddings of planar graphs. Tech. rep. MIT, Cambridge, Mass.
20. ELLIS, J. A., SUDBOROUGH, I. H., AND TURNER, J. S. 1994. The vertex separation and search number of a graph. Inf. Compiit. 113, 50-79.
21. EVEN, G., NAOR, J., RAO, S., AND SCHIEBER, B. 1995. Divide-and-conquer approximation algorithms via spreading metrics. In Proceedings of the 36th Annual Symposium on Foundations of Computer Science (Oct.), IEEE Computer Society Press, Los Alamitos, Calif., pp. 62-71.
22. EVEN, G., NAOR, J., RAO, S., AND SCHIEBER, B. 1997. Fast approximate graph partitioning algorithms. In Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, pp. 639-648.
23. EVEN, G., NAOR, J., SCHIEBER, B., AND SUDAN, M. 1998. Approximating minimum feedback sets and multicuts in directed graphs. Algorithmica 20, 2, 151-174.
24. FORD, L. R. AND FULKERSON, D. R. 1956. Sur le problème des courbes gauches en topologic. Canad. J. Math 8, 399-404.
25. FRANK, A. 1990. Packing paths, circuits and cuts-A survey. In Paths, Flows, and VLSI-Layout, B. Körte, L. Lovâsz, H. J. Prömel, and A. Schrijver, eds. Springer-Verlag, Berlin, Germany, pp. 47-100.
26. GAREY, M. R. AND JOHNSON, D. S. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, Calif.
27. GARG, N., VAZARANI, V., AND YANNAKAKIS, M. 1996. Approximate max-flow min-(multi)cut theorems and their applications. SIAM J. Comptit. 25, 235-251.
28. HANSEN, M. 19S9. Approximation algorithms for geometric embcddings in the plane and applications to parallel processing problems. In Proceedings of the 30th Annual Symposium on Foundations of Computer Science (Oct.). IEEE Computer Science Society Press, Los Alamitos, Calif., pp. 604-609.
29. HEYDEMANN, M. C., MEYER, J. C., AND SOTTEAU, D. 1989. On forwarding indices of networks. Discrete Applied Mathematics 23, 103-123.
30. HEYDEMANN, M. C., MEYER, J. C., AND SOTTEAU, D. 1992, Forwarding indices of fc-connected graphs. Disc. Appl. Math. 37/38, 287-296.
31. HEYDEMANN, M. C., MEYER, J. C., AND SOTTEAU, D. 1994. Forwarding indices of consistent routings and their complexity. Networks 24, 75-82.
32. Hu, T. C. 1963. Multicommodity network flows. Oper. Res. II, 3, 344-360.
33. IRI, M. 1967. On an extension of the maximum-flow minimum cut theorem to multicommodity flows. J. Oper. Res. Soc. Japan 5, 4 (Dec.), 697-703.
34. KAMATH, A. AND PALMON, O. 1995. Improved interior point algorithms for exact and approximate solutions of multicommodity flow problems. In Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms (San Francisco, Calif., Jan. 22-24). ACM, New York, pp. 502-511.
35. KIROUSIS, L. M. AND PAPADIMITRIOU, C. H. 1986. Searching and pebbling. Theoret. Comptit. Sei. 47, 205-216.
36. KLEIN, P., AGRAWAL, A., RAO, S., AND RAVI, R. 1989. Approximation through multicommodity flow. In Proceedings of the 30th Annual Symposium on Foundations of Computer Science (Oct.). IEEE Computer Society Press, Los Alamitos, Calif., pp. 726-737.
37. KLEIN, P., PLOTKIN, S., RAO, S., AND TARDOS, E. 1997. Bounds on the max-flow min-cut ratio for directed multicommodity flows. J. Algorithms 22, 241-269.
38. KLEIN, P., PLOTKIN, S., STEIN, C., AND TARDOS, E. 1994. Faster approximation algorithms for the unit capacity concurrent flow problem with applications to routing and finding sparse cuts. SIAM J. Comptit. 23, 466-487.
39. KLEIN, P., RAO, S., AGRAWAL, A., AND RAVI, R. 1995. Approximation through multicommodity flow. Combinatorica 15, 187-202.
40. KLEIN, P., PLOTKIN, S., AND RAO, S. 1993. Excluded minors, network decomposition, and multicommodity flow. In Proceedings of the 25th Annual ACM Symposium on Theory of Computing (San Diego, Calif., May 16-18). ACM, New York, pp. 682-690.
41. KLEIN, P. N., BORGER, J. M., AND KANG, S. 1991. Approximating concurrent flow with uniform demands and capacities: An implementation. In Proceedings of DIMACS Implementation Challenge Workshop: NetH-ork Flows and Matching (Oct.). AMS, Providence, R.I., pp. 371-386.
42. LANG, K. AND RAO, S. 1993. Finding near-optimal cuts: An empirical evaluation. In Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, pp. 212-221.
43. LEIGHTON, F. T. 1983. Complexity Issues in VLSI: Optimal Layouts for the Shuffle-Exchange Graph and Other Networks. MIT Press, Cambridge, Mass.
44. LEIGHTON, F. T., MAGGS, B., AND RAO, S. 1994. Packet routing and job-shop scheduling in o(congestion + dilation) steps. Combinatorica 14, 2, 167-180.
45. LEIGHTON, F. T. AND RAO, S. 1996. Circuit switching: A multicommodity flow based approach. In Proceedings of the 1st Workshop on Randomized Parallel Computing (Apr.).
46. LEIGHTON, F. T., RAO, S. B., AND SRINIVASAN, A. 1998. Multi-commodity flow and circuit switching. In Proceedings of the 31st Hawaii International Conference on System Sciences, vol. 7. IEEE Computer Society Press, Los Alamitos, Calif., pp. 466-474.
47. LEIGHTON, F. T. AND RAO, S. 1988. An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. In Proceedings of the 28th Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., pp. 256-269.
48. LEIGHTON, F. T., MAKEDON, F., PLOTKIN, S., STEIN, C., TARDOS, E., AND TRAGOUDAS, S. 1992. Fast approximation algorithms for multicommodity flow problems. J. Comput. Syst. Sei. SO, 228-243.
49. IEEE Computer Society Press, Los Alamitos, Calif.
50. LEIGHTON, T. AND MAGGS, B. 1995. Fast algorithms for finding O(congestion + dilation) packet routing schedules. In Proceedings of the 28th Hawaii International Conference on System Sciences (IIICSS), vol. 2. IEEE Computer Society Press, Los Alamitos, Calif., pp. 555-563.
51. LEIGHTON, T., MAGGS, B., AND RICIIA, A. 1995. Fast algorithms for finding O(congestion + dilation) packet routing schedules. Tech. Rep. School of Computer Science, Carnegie Mellon University, Pittsburgh, Pa.
52. LEISERSON, C. E. 1980. Area-efficient layouts (for VLSI). In Proceedings of the 21st Annual Symposium on Foundations of Computer Science (Oct.). IEEE Computer Science Press, Los Alimatos, Calif., pp. 270-281.
53. LEONG, T., SHOR, P., AND STEIN, C. 1991. Implementation of a combinatorial multicommodity flow algorithm. In DIMACS Series in Discrete Mathematics and Theoretical Computer Science: Volume 12, Network Flows and Matching, D. S. Johnson and C. C. McGeoch, eds. (Oct.). AMS, Providence R.I., pp. 387-406.
54. LINIAL, N., LONDON, E., AND RABINOVICH, Y. 1995. The geometry of graphs and some of its algorithmic applications. Combinatorica 15, 215-245.
55. LIPTON, J. AND TARJAN, R. E. 1979. A separator theorem for planar graphs. SIAM J. Appl. Math. 36, 2 (Apr.), 177-189.
56. LOMONOSOV, M. V. 1985. Combinatorial approaches to multiflow problems. Disc. Appl. Math. 11, 1-94.
57. LOVâSZ, L. 1991. Random walk on graphs: A survey. Tech. Rep. Dcpt. Computer Science, Yale Univ., New Haven, Conn.
58. MARGULIS, G. A. 1973. Explicit constructions of concentrators. Prob. Inf. Trans. 9, 325-332.
59. MATULA, D. W. AND SIIAHROKHI, F. 1986. The maximum concurrent flow problem and sparsest cuts. Tech. Rep. Southern Methodist Univ., Dallas, Tex.
60. OKAMURA, H. AND SEYMOUR, P. D. 1981. Multicommodity flows in planar graphs. J. Combin. Theory, Ser. B 31, 75-81.
61. PAPERNOV, B. A. 1990. Feasibility of multicommodity flows (in Russian). In Studies in Discrete Optimization, A. A. Friedman, ed. New York, pp. 17-34.
62. PARK, J. AND PHILLIPS, C. 1993. Finding minimum quotient cuts in planar graphs. In Proceedings of the 25th Annual ACM Symposium on Theory of Computing (San Diego, Calif., May 16-18). ACM, New York, pp. 766-775.
63. PELEG, D. AND UPFAL, E. 1989. The token distribution problem. SIAM J. Comput. IS, 1 (Apr.), 229-243.
64. PLOTKIN, S. AND TARDOS, E. 1993. Improved bounds on the max-flow min-cut ratio for multicommodity flows. In Proceedings of the 25th Annual ACM Symposium on Theory of Computing (San Diego, Calif., May 16-18). ACM, New York, pp. 691-697.
65. RAGHAVAN, P. 1988. Probabilistic construction of deterministic algorithms: Approximate packing integer programs. J. Comput. Syst. Sei. 37, 4 (Oct.), 130-143.
66. RAGHAVAN, P. AND UPFAL, E. 1994. Efficient routing all-optical networks. In Proceedings of the 26th Annual ACM Symposium on Theory of Computing (Montreal, Que., Canada, May 23-25). ACM, New York, pp. 134-143.
67. RAO, S. 1992. Faster algorithms for finding small edge cuts in planar graphs. In Proceedings of the 24th Annual ACM Symposium on Theory of Computing (Victoria, B.C., Canada, May 4-6). ACM, New York, pp. 229-240.
68. RAVI, R., AGRAWAL, A., AND KLEIN, P. N. 1991. Ordering problems approximated: Single-processor scheduling and interval graph completion. In Proceedings, 18th International Conference on Automata, Languages, and Programming. Lecture Notes in Computer Science, vol. 510. SpringerVerlag, New York, pp. 751-762.
69. SCHRIJVER, A. 1990. Homotopic routing methods. In Paths, Flows, and VLSI-Layout, B. Körte, L. Lovasz, H. J. Promel, and A. Schrijver, eds. Springer-Verlag, Berlin, Germany, pp. 329-371.
70. SEYMOUR, P. D. 1995. Packing directed circuits fractionally. Combinatorica 15, 281-288.
71. SHAHROKHI, F. AND MATULA, D. W. 1990. The maximum concurrent flow problem. J. ACM 37, 318-334.
72. SHMOYS, D. B. 1996. Cut problems and their application to divide-and-conquer. In Approximation Algorithms, D. S. Hochbaum, ed. PWS Publishers, Boston, Mass., pp. 192-235.
73. SINCLAIR, A. 1991. Improved bounds for mixing rates of Markov chains and multicommodity flow. Tech. Rep. Laboratory for Foundations of Computer Science, Department of Computer Science, The University of Edinburgh, Edinburgh, Scotland.
74. SINCLAIR, A. 1993. Algorithms for Random Generating and Counting. Birkhäuser, Boston, Mass.
75. SINCLAIR, A. J. AND JERRUM, M. R. 1989. Approximate counting, uniform generation and rapidly mixing Markov chains. Inf. Compiit. 82, 93-133.
76. TARJAN, R. E. 1983. Data Structures and Nefivork Algorithms. SIAM, Philadelphia, Pa.
77. TRAGOUDAS, S. 1990. VLSI partitioning approximation algorithms based on multicommodity flows and other techniques. Ph.D. dissertation. Dept. Comput. Sei., Univ. Texas, Dallas, Dallas, Tex.
78. VAIDYA, P. M. 1989. Speeding up linear programming using fast matrix multiplication. In Proceed-ings of the 30th Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, pp. 332-337.
79. VALIANT, L. 1981. Universality considerations in VLSI circuits. IEEE Trans. Comput. C-30, 2, 135-140.
80. YEH, C. W., CHENO, C. K., AND LIN, T. T. 1992. A probabilistic multicommodity-flow solution to circuit clustering problems. In Proceedings of the IEEE International Conference on Computer-Aided Design. IEEE Computer Society Press, Los Alamitos, Calif, pp. 428-431.