Skip to main content
SpringerLink
Log in

Approximating Multicast Congestion

  • Conference paper
  • First Online:
Book cover Algorithms and Computation (ISAAC 1999)

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

Included in the following conference series:

Abstract

We present a randomized algorithm for approximating multicast congestion (a generalization of path congestion) to within O(log n) times the best possible. Our main tools are a linear programming relaxation and iterated randomized rounding.

Santosh Vempala was supported by a Miller fellowship at U.C.Berkeley and an NSF CAREER award. Berthold Vöcking was supported by a grant of the “Gemeinsames Hochschulsonderprogramm III von Bund und Ländern” through the DAAD.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Bern, and P. Plassmann, The Steiner problem with edge lengths 1 and 2. Information Processing Letters 32:171–176, 1989.

    MATH  MathSciNet  Google Scholar 

  2. M. Grötschel, L. Lovász and A. Schrijver, Geometric Algorithms and Combinatorial Optimization. Springer-Verlag, 1987.

    Google Scholar 

  3. S. Hougardy and H. J. Promel, A 1.598 approximation algorithm for the steiner problem in graphs. Proc. 10th Ann. ACM-SIAM Symp. on Discrete Algorithms, ACM-SIAM, 448–453, 1999.

    Google Scholar 

  4. T. Hagerup and C. Rüb, A guided tour of Chernoff bounds. Information Processing Letters 33(6):305–308, 1990.

    MATH  Google Scholar 

  5. R. M. Karp, Reducibility among combinatorial problems. Complexity of Computer Computations, R. E. Miller, J. W. Thatcher, Eds., Plenum Press, New York, 85–103, 1972.

    Google Scholar 

  6. P. Raghavan and C.D. Thompson Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica, 7(4):365–374, 1987.

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Mathematics, MIT, Berkeley

    Santosh Vempala

  2. International Computer Science Institute, Berkeley

    Berthold Vöcking

Authors
  1. Santosh Vempala
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Berthold Vöcking
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Vempala, S., Vöcking, B. (1999). Approximating Multicast Congestion. In: Algorithms and Computation. ISAAC 1999. Lecture Notes in Computer Science, vol 1741. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46632-0_37

Download citation

  • DOI: https://doi.org/10.1007/3-540-46632-0_37

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66916-6

  • Online ISBN: 978-3-540-46632-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation