Skip to main content
SpringerLink
Log in

An Improved Approximation Algorithm for Multicast k-Tree Routing

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

An improved approximation algorithm is presented in this paper for the multicast k-tree routing problem. The algorithm has a worst case performance ratio of (2.4 + ρ), where ρ is the best approximation ratio for the metric Steiner tree problem (and is about 1.55 so far). The previous best approximation algorithm for the multicast k-tree routing problem has a performance ratio of 4. Two techniques, weight averaging and tree partitioning, are developed to facilitate the algorithm design and analysis.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness. W.H. Freeman and Company, San Francisco, 1979.

    Google Scholar 

  • C. Gröpl, S. Hougardy, T. Nierhoff, and H.J. Prömel, “Approximation algorithms for the Steiner tree problem in graphs,” In D.-Z. Du and X. Cheng (Eds.), Steiner Trees in Industries, Kluwer Academic Publishers, 2001, pp. 235–279.

  • J. Gu, X.D. Hu, and M.H. Zhang, “Algorithms for multicast connection under multi-path routing model,” Information Processing Letters, vol. 84, pp. 31–39, 2002.

    Article  Google Scholar 

  • R.L. Hadas. “Efficient collective communication in WDM networks,” in Proceedings of IEEE ICCCN 2000, 2000, pp. 612–616.

  • X.-D. Hu, T.-P. Shuai, X. Jia, and M. H. Zhang, “Multicast routing and wavelength assignment in WDM networks with limited drop-offs,” In Proceedings of IEEE INFOCOM 2004, 2004.

  • C. Huitema, Routing in the Internet. Prentice Hall PTR, 2000.

  • F. Kuo, W. Effelsberg, and J.J. Garcia-Luna-Aceves, Multimedia Communications: Protocols and Applications. Prentice Hall, Inc., 1998.

  • G. Robins and A. Zelikovsky, “Improved Steiner tree approximation in graphs,” in Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2000), 2000, pp. 770–779.

  • A.S. Tanenbaum, Computer Networks. Prentice Hall PTR, Upper Saddle River, NJ, 1996.

    Google Scholar 

  • Z. Wang and J. Crowcroft, “Quality-of-service routing for supporting multimedia applications,” IEEE Journal on Selected Areas in Communications, vol. 14, pp. 1228–1234, 1996.

    Article  Google Scholar 

  • X. Zhang, J. Wei, and C. Qiao, “Constrained multicast routing in WDM networks with sparse light splitting,” in Proceedings of IEEE INFOCOM 2000, March 26–30, 2000, pp. 1781–1790.

Download references

Author information

Authors and Affiliations

  1. Department of Computing Science, University of Alberta. Edmonton, Alberta, T6G 2E8, Canada

    Guohui Lin

Authors
  1. Guohui Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Guohui Lin.

Additional information

Research supported by AICML, CFI, NSERC, PENCE, a Startup Grant from the University of Alberta, and NNSF Grant 60373012.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lin, G. An Improved Approximation Algorithm for Multicast k-Tree Routing. J Comb Optim 9, 349–356 (2005). https://doi.org/10.1007/s10878-005-1776-x

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-005-1776-x

Keywords

Search

Navigation