Excluded minors, network decomposition, and multicommodity flow

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129585, Issue , 1993, Pages 682-690

  Klein, Philip ^a   Plotkin, Serge A ^b   Rao, Satish ^c  

^a BROWN UNIVERSITY   (United States)

^b STANFORD UNIVERSITY   (United States)

^c NEC LABORATORIES AMERICA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; APPROXIMATION THEORY; COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; FLOW GRAPHS; GRAPHIC METHODS; ALGORITHMS; DATA PROCESSING; GRAPH THEORY; OPTIMIZATION; THEOREM PROVING;

BOUNDED-GENUS GRAPHS; EXCLUDED-MINORS; FIXED GRAPHS; GENERAL GRAPH; MULTI-COMMODITY FLOW; NETWORK DECOMPOSITION; PERFORMANCE BOUNDS; PLANAR GRAPH;

GRAPH THEORY; DATA COMMUNICATION SYSTEMS;

CONCURRENT FLOW PROBLEM; MAXIMUM FLOW PROBLEM; MULTICOMMODITY FLOW PROBLEM;

EID: 0027150658     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/167088.167261     Document Type: Conference Paper

References (18)

1. B. Awerbuch, B. Berger, L. Cowen, and D. Peleg. Fast constructions of sparse neighborhood covers. In Proc. 10th Annual ACM Symposium on Principles of Distributed Computing, 1992.
2. B. Awerbuch, A. Y. Goldberg, M. Luby, and S. A. Plotkin. Network Decomposition and Locality in Distributed Computation, In Proc. 30th IEEE An-nual Symposium on Foundations of Computer Science, pages 364-369, 1989.
3. B. Awerbuch and D. Peleg. Routing with polynomial communication-space trade-off. SIAMJ. Disc. Math, 5(2):151-162, 1992.
4. Baruch Awerbuch, Amotz Bar-Noy, Nati Linial, and David Peleg. Improved routing strategies with suc-cinct tables. J. Alg., 11:307-341, 1990.
5. Baruch Awerbuch and David Peleg. Network syn-chronization with polylogarithmic overhead. In Proc. 31st IEEE Annual Symposium on Foundations of Com-puter Science, pages 514-522, 1990.
6. Sandeep N. Bhatt and Tom Leighton. A framework for solving VLSI layout problems. J. Comp. andSyst. Set., 28(2):300-343, April 1984.
7. P. Elias, A. Feinstein, and C.E. Shannon. A note on the maximum flow through a network. IRS Trans. Information Theory, 2:117-119, 1956.
8. L. R. Ford Jr. and D. R. Fulkerson. Maximal Flow Through a Network. Canadian Journal of Math., 8:399-404, 1956.
9. N. Garg, V. V. Vazirani, and M. Yannakakis. Approx-imate max-flow min-(multi)cut theorems and their applications. In Proc. 23th ACM Symposium on the Theory of Computing, May 1993.
10. P. N. Klein, S. Rao, A. Agrawal, and R. Ravi. An approximate max-flow min-cut relation for multi- commodity flow, with applications. Submitted to Combinatorica (1992). Preliminary version appeared as "Approximation through multicommodity flow, " In Proc. 31th IEEE Annual Symposium on Foundations of Computer Science, pages 726-727, 1990.
11. T. Leighton and S. Rao. An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algo-rithms. In Proc. 29th IEEE Annual Symposium on Foundations of Computer Science, pages 422-431
12. N. Linial and M. Saks. Decomposing graphs into regions of small diameter. In Proc. 2ndACM-SIAM Symposium on Discrete Algorithms, pages 320-330. ACM/SIAM, January 1991.
13. H. Okamura and P.D. Seymour. Multicommodity flows in planar graphs. J. Combinatorial Theory (B), 31:75-81, 1981.
14. D. Peleg and E. Upfal. A tradeoff between size and efficiency for routing tables. J. ACM, 36:510-530
15. S. Plotkin and Tardos. Improved bounds on the max-flow min-cut ratio for multicommodity flows. In Proc. 23th ACM Symposium on the Theory of Com-puting, May 1993.
16. P.D. Seymour. Matroids and multicommodity flows. European Journal of Combinatorics, 2:257-290, 1981.
17. F. Shahrokhi and D. Matula. The maximum concur-rent flow problem. J. Assoc. Comput. Mach., 37:318- 334, 1990.
18. S. Tragoudas. VLSI partitioning approximation algo-rithms based on multicommodity flow and other tech-niques. PhD thesis, University of Texas at Dallas, 1991.