An improved decomposition theorem for graphs excluding a fixed minor

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

Volumn 2764, Issue , 2003, Pages 36-46

  Fakcharoenphol, Jittat ^a   Talwar, Kunal ^b  

^a KASETSART UNIVERSITY   (Thailand)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; DOMAIN DECOMPOSITION METHODS; FLOW GRAPHS; GRAPH THEORY; GRAPHIC METHODS; OPTIMIZATION;

DECOMPOSITION THEOREMS; GRAPH G; MAX-FLOW MIN-CUT; METRIC EMBEDDINGS; MULTI-COMMODITY; PERFORMANCE GUARANTEES;

APPROXIMATION ALGORITHMS;

EID: 21144454494     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45198-3_4     Document Type: Article

References (34)

1. G. Adel'son-Vel'ski, E. Dinits, and A. Karzanov. Flow Algorithms. Nauka, Moscow, 1975. In Russian.
2. Y. Aumann and Y. Rabani. An O(log k) approximate min-cut max-flow theorem and approximation algorithm. SIAM J. Comput., 27(1):291-301, 1998.
3. Y. Azar, E. Cohen, A. Fiat, H. Kaplan, and H. Räcke. Optimal oblivious routing in polynomial time. In Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, 2003.
4. S. N. Bhatt and F. T. Leighton. A framework for solving VLSI graph layout problems. Journal of Computer and System Sciences, 28(2):300-343, Apr. 1984.
5. M. Bienkowski, M. Korzeniowski, and H. Räcke. A practical algorithm for constructing oblivious routing schemes. In Fifteenth ACM Symposium on Parallelism in Algorithms and Architectures, June 2003.
6. G. Calinescu, H. Karloff, and Y. Rabani. Approximation algorithms for the O-Extension problem. In Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01), pages 8-16, New York, Jan. 7-9 2001. ACM Press.
7. M. Charikar, C. Chekuri, A. Goel, S. Guha, and S. Plotkin. Approximating a finite metric by a small number of tree metrics. In IEEE, editor, 39th Annual Symposium on Foundations of Computer Science: proceedings: November 8-11, 1998, Palo Alto, California, pages 379-388, 1109 Spring Street, Suite 300, Silver Spring, MD 20910, USA, 1998. IEEE Computer Society Press.
8. P. Elias, A. Feinstein, and C. E. Shannon. A note on the maximum flow through a network. IEEE Trans. Inform. Th., IT-2:117-119, 1956.
9. L. R. Ford and D. R. Fulkerson. Flows in Networks. Princeton Univ. Press, Princeton, NJ, 1962.
10. A. Frank. Packing paths, circuits, and cuts - a survey. In B. Korte, L. Lovász, H.-J. Prömel, and A. Schrijver, editors, Paths, Flows and VLSI-Layouts, pages 47-100. Springer Verlag, 1990.
11. N. Garg, V. V. Vazirani, and M. Yannakakis. Approximate max-flow min-(multi)cut theorems and their applications. In Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, pages 698-707. ACM Press, 1993.
12. O. Günlük. A new min-cut max-flow ratio for multicommodity flows. Lecture Notes in Computer Science: Integer Programming and Combinatorial Optimization, 2337:54-66, 2002.
13. C. Harrelson, K. Hildrum, and S. Rao. A polynomial-time tree decomposition to minimize congestion. In Symposium on Parallel Algorithms and Architectures, 2003.
14. T. Hu. Multicommodity network flows. Operations Research, 11:344-360, 1963.
15. P. Klein, S. A. Plotkin, and S. Rao. Excluded minors, network decomposition, and multicommodity flow. In Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, pages 682-690. ACM Press, 1993.
16. P. N. Klein, S. Rao, A. Agrawal, and R. Ravi. An approximate max-flow min-cut relation for unidirected multicommodity flow, with applications. Combinatorica, 15(2):187-202, 1995.
17. K. Kuratowski. Sue le problème des courbes gauches en topologie. Fund. Math., 15:217-283, 1930.
18. T. Leighton and S. Rao. An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. In 29th Annual Symposium on Foundations of Computer Science, pages 422-431, White Plains, New York, 24-26 Oct. 1988. IEEE.
19. N. Linial, E. London, and Y. Rabinovich. The geometry of graphs and some of its algorithmic applications. COMBINAT: Combinatorica, 15, 1995.
20. M. V. Lomonosov. Combinatorial approaches to multiflow problems. Discrete Applied Math., 11:1-94, 1985.
21. B. M. Maggs, F. M. auf der Heide, B. Vöcking, and M. Westermann. Exploiting locality for data management in systems of limited bandwidth. In 38th Annual Symposium on Foundations of Computer Science, pages 284-293, Miami Beach, Florida, 20-22 Oct. 1997. IEEE.
22. H. Okamura and P. Seymour. Multicommodity flows in planar graphs. Journal of Combinatorial Theory, Series B, 31:75-81, 1981.
23. S. A. Plotkin and E. Tardos. Improved bounds on the max-flow min-cut ratio for multicommodity flows. In ACM Symposium on Theory of Computing, pages 691-697, 1993.
24. 1 and into the line yuri rabinovich. In Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, 2003.
25. H. Räcke. Minimizing congestion in general networks. In Proceedings of the 43rd Annual Symposium on the Foundations of Comuter Science, pages 43-52, Nov. 2002.
26. S. Rao. Small distortion and volume preserving embeddings for planar and cuclidean metrics. In Proceedings of the fifteenth annual symposium on Computational geometry, pages 300-306. ACM Press, 1999.
27. S. Rao and A. W. Richa. New approximation techniques for some ordering problems. In Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 211-218, San Francisco, California, 25-27 Jan. 1998.
28. N. Robertson and P. D. Seymour. Graph minors. VIII. a Kuratowski theorem for general surfaces. Journal of Combinatorial Theory Series B, 48(2):255-288, 1990.
29. B. Rothschild and A. Whinston. On two commodity network flows. Operations Res., 14:377-387, 1966.
30. P. Seymour. Matroids and multicommodity flows. European Journal of Combinatorics, 2:257-290, 1981.
31. P. D. Seymour. Four-terminus flows. Networks, 10:79-86, 1980.
32. F. Shahrokhi and D. W. Matula. The maximum concurrent flow problem. Journal of the ACM (JACM), 37(2):318-334, 1990.
33. r,r-free graphs. Information Processing Letters, 47:77-80, August 1993.
34. S. Tragoudas. VLSI partitioning approximation algorithms based on multicommodity flow and other techniques. PhD thesis, University of Texas, Dallas, 1991.