Skip to main content
SpringerLink
Log in

Fast Approximation of Minimum Multicast Congestion — Implementation versus Theory

Extended Abstract

  • Conference paper
  • First Online:
Book cover Algorithms and Complexity (CIAC 2003)

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

Included in the following conference series:

Abstract

The problem of minimizing the maximum edge congestion in a multicast communication network generalizes the well-known NP-hard standard routing problem. We present the presently best theoretical approximation results as well as efficient implementations.

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. J. Aspnes, Y. Azar, A. Fiat, S. Plotkin, O. Waarts, On-line routing of virtual circuits with applications to load balancing and machine scheduling, J. of the Association for Computing Machinery 44(3), 486–504, 1997.

    MATH  MathSciNet  Google Scholar 

  2. R. Carr, S. Vempala, Randomized Metarounding, Proc. of the 32nd ACM Symposium on the theory of computing (STOC’ 00), Portland, USA, 58–62, 2000

    Google Scholar 

  3. N. Garg, J. Könemann, Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems. In Proc. 39th IEEE Annual Symposium on Foundations of Computer Science, 1998.

    Google Scholar 

  4. A.V. Goldberg, A natural randomization strategy for multicommodity flow and related algorithms, Information Processing Letters 42, 249–256, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  5. A.V. Goldberg, A.D. Oldham, S. Plotkin, C. Stein, An Implementation of a Combinatorial Approximation Algorithm for Minimum-Cost Multicommodity Flows. In Proc. 6th Conf. on Integer Prog. and Combinatorial Optimization, 1998.

    Google Scholar 

  6. M.D. Grigoriadis, L.G. Khachiyan, Fast approximation schemes for convex programs with many blocks and coupling constraints, SIAM J. on Optimization 4, 86–107, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  7. K. Jansen, H. Zhang, An approximation algorithm for the multicast congestion problem via minimum Steiner trees, In Proc. 3rd Int. Worksh. on Approx. and Random. Alg. in Commun. Netw. (ARANCE’02), Roma, Italy, September 21, 2002.

    Google Scholar 

  8. K. Jansen, H, Zhang, Approximation algorithms for general packing problems with modified logarithmic potential function, In Proc. 2nd IFIP Int. Conf. on Theoretical Computer Science (TCS’02), Montréal, Québec, Canada, August 25–30, 2002.

    Google Scholar 

  9. P. Klein, S. Plotkin, C. Stein, E. Tardos, Faster Approximation Algorithms for the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts, SIAM J. on Computing 23 No. 3, 466–487, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  10. T. Leighton, F. Makedon, S. Plotkin, C. Stein, E. Tardos, S. Tragoudas, Fast approximation algorithms for multicommodity flow problems, J. of Comp. and System Sciences 50, 228–243, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  11. D.W. Matula, F. Shahrokhi, The maximum concurrent flow problem, J. of the Association for Computing Machinery 37, 318–334, 1990.

    MATH  MathSciNet  Google Scholar 

  12. K. Mehlhorn, A faster approximation algorithm for the Steiner problem in graphs, Information Processing Letters 27, 125–128, 1988.

    Article  MATH  MathSciNet  Google Scholar 

  13. S. Plotkin, D. Shmoys, E. Tardos, Fast approximation algorithms for fractional packing and covering problems, Math. Oper. Res. 20, 257–301, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  14. T. Radzik, Fast deterministic approximation for the multicommodity flow problem, Math. Prog. 78, 43–58, 1997.

    Article  MathSciNet  Google Scholar 

  15. P. Raghavan, Probabilistic construction of deterministic algorithms: Approximating packing integer programs, J. of Comp. and System Sciences 38, 683–707, 1994.

    MathSciNet  Google Scholar 

  16. A. Srivastav, P. Stangier, On complexity, representation and approximation of integral multicommodity flows, Discrete Applied Mathematics 99, 183–208, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  17. S. Vempala, B. Vöcking, Approximating Multicast Congestion, Proc. 10th ISAAC, Chennai, India, 1999.

    Google Scholar 

  18. G. Robins, A. Zelikovsky, Improved Steiner tree approximation in graphs, Proc. of the 11th Annual ACM-SIAM Symp. on Discrete Algorithms (SODA 2000), 770–779, 2000.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematisches Seminar der Christian-Albrechts-Universitä zu Kiel, Ludewig-Meyn-Str. 4, D-24098, Kiel, Germany

    Andreas Baltz & Anand Srivastav

Authors
  1. Andreas Baltz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Anand Srivastav
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Infornatica, Università di Roma “La Sapienza”, Via Salaria 113, 00198, Rome, Italy

    Rossella Petreschi  & Riccardo Silvestri  & 

  2. Dipartimento di Infornatica ed Applicazioni “R.M. Capocelli”, Università di Salerno, Via S. Allende 2, 84081, Baronissi, SA, Italy

    Giuseppe Persiano

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Baltz, A., Srivastav, A. (2003). Fast Approximation of Minimum Multicast Congestion — Implementation versus Theory. In: Petreschi, R., Persiano, G., Silvestri, R. (eds) Algorithms and Complexity. CIAC 2003. Lecture Notes in Computer Science, vol 2653. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44849-7_22

Download citation

  • DOI: https://doi.org/10.1007/3-540-44849-7_22

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation