Skip to main content
SpringerLink
Log in

Designing multi-commodity flow trees

  • Conference paper
  • First Online:
Algorithms and Data Structures (WADS 1993)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 709))

Included in the following conference series:

Abstract

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).

Part of this work was done while this author was visiting UMIACS.

Research supported in part by NSF grants CCR-8906949 and CCR-9111348.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. R. E. Gomory and T. C. Hu. Multi-terminal network flows. Journal of SIAM, 9(4): 551–570, 1961.

    Google Scholar 

  3. D. Gusfield. Very simple methods for all pairs network flow analysis. SIAM Journal on Computing, 19(1): 143–155, 1990.

    Article  Google Scholar 

  4. 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. S. Rao. Personal communication.

    Google Scholar 

  6. P. Seymour and R. Thomas. Call routing and the rat catcher. Workshop on Algorithms and Combinatorial Optimization, March 1991. Atlanta, GA.

    Google Scholar 

  7. É. Tardos. Personal communication.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Maryland, 20742, College Park, MD

    Samir Khuller

  2. Computer Science Department, Pennsylvania State University, 16802, University Park, PA

    Balaji Raghavachari

  3. Institute for Advanced Computer Studies, University of Maryland, 20742, College Park, MD

    Neal Young

Authors
  1. Samir Khuller
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Balaji Raghavachari
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Neal Young
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Frank Dehne Jörg-Rüdiger Sack Nicola Santoro Sue Whitesides

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Khuller, S., Raghavachari, B., Young, N. (1993). Designing multi-commodity flow trees. In: Dehne, F., Sack, JR., Santoro, N., Whitesides, S. (eds) Algorithms and Data Structures. WADS 1993. Lecture Notes in Computer Science, vol 709. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57155-8_268

Download citation

  • DOI: https://doi.org/10.1007/3-540-57155-8_268

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57155-1

  • Online ISBN: 978-3-540-47918-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation