Designing multi-commodity flow trees

  • Samir Khuller
  • Balaji Raghavachari
  • Neal Young
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 709)


The traditional multi-commodity flow problem assumes a given flow network in which multiple commodities are to be maximally routed in response to given demands. This paper considers the multi-commodity flow network-design problem: given a set of multi-commodity flow demands, find a network subject to certain constraints such that the commodities can be maximally routed.

This paper focuses on the case when the network is required to be a tree. The main result is an approximation algorithm for the case when the tree is required to be of constant degree. The algorithm reduces the problem to the minimum-weight balanced-separator problem; the performance guarantee of the algorithm is within a factor of 4 of the performance guarantee of the balanced-separator procedure. If Leighton and Rao's balanced-separator procedure is used, the performance guarantee is O(log n).


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [GJ]
    M. R. Garey and D. S. Johnson, “Computers and Intractability: A guide to the theory of NP-completeness”, Freeman, San Francisco (1979).Google Scholar
  2. [GH]
    R. E. Gomory and T. C. Hu. Multi-terminal network flows. Journal of SIAM, 9(4): 551–570, 1961.Google Scholar
  3. [Gu]
    D. Gusfield. Very simple methods for all pairs network flow analysis. SIAM Journal on Computing, 19(1): 143–155, 1990.CrossRefGoogle Scholar
  4. [LR]
    F. 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 Annual Symp. on Foundations of Computer Science, pages 422–431, October 1988. White Plains, NY.Google Scholar
  5. [Rao]
    S. Rao. Personal communication.Google Scholar
  6. [ST]
    P. Seymour and R. Thomas. Call routing and the rat catcher. Workshop on Algorithms and Combinatorial Optimization, March 1991. Atlanta, GA.Google Scholar
  7. [Tar]
    É. Tardos. Personal communication.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Samir Khuller
    • 1
  • Balaji Raghavachari
    • 2
  • Neal Young
    • 3
  1. 1.Department of Computer ScienceUniversity of MarylandCollege Park
  2. 2.Computer Science DepartmentPennsylvania State UniversityUniversity Park
  3. 3.Institute for Advanced Computer StudiesUniversity of MarylandCollege Park

Personalised recommendations