Skip to main content
SpringerLink
Log in
Book cover

Workshop on Algorithms and Data Structures

WADS 2003: Algorithms and Data Structures pp 401–411Cite as

Improved Approximation Algorithms for the Quality of Service Steiner Tree Problem

  • Conference paper

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

Abstract

The Quality of Service Steiner Tree Problem is a generalization of the Steiner problem which appears in the context of multimedia multicast and network design. In this generalization, each node possesses a rate and the cost of an edge with length l in a Steiner tree T connecting the non-zero rate nodes is l ·r e , where r e is the maximum rate in the component of T-{e} that does not contain the source. The best previously known approximation ratios for this problem (based on the best known approximation factor of 1.549 for the Steiner tree problem in networks) are 2.066 for the case of two non-zero rates and 4.211 for the case of unbounded number of rates. We give better approximation algorithms with ratios of 1.960 and 3.802, respectively. When the minimum spanning tree heuristic is used for finding approximate Steiner trees, then the previously best known approximation ratios of 2.667 for two non-zero rates and 5.542 for unbounded number of rates are reduced to 2.414 and 4.311, respectively.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Balakrishnan, A., Magnanti, T.L., Mirchandani, P.: Modeling and Heuristic Worst-Case Performance Analysis of the Two-Level Network Design Problem. Management Science 40, 846–867 (1994)

    Article  MATH  Google Scholar 

  2. Balakrishnan, A., Magnanti, T.L., Mirchandani, P.: Heuristics, LPs, and Trees on Trees: Network Design Analyses. Operations Research 44, 478–496 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  3. Berman, P., Ramaiyer, V.: Improved Approximations for the Steiner Tree Problem. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA 1992), pp. 325–334 (1992)

    Google Scholar 

  4. Borchers, A., Du, D.Z.: The k-Steiner Ratio in Graphs. SIAM Journal on Computing 26, 857–869 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  5. Charikar, M., Naor, J., Schieber, B.: Resource Optimization in QoS Multicast Routing of Real-Time Multimedia. In: Proceedings of the 19th Annual IEEE INFOCOM (2000)

    Google Scholar 

  6. Current, J.R., Revelle, C.S., Cohon, J.L.: The Hierarchical Network Design Problem. European Journal of Operations Research 27, 57–66 (1986)

    Article  MATH  Google Scholar 

  7. Maxemchuk, N.: Video Distribution on Multicast Networks. IEEE Journal on Selected Issues in Communications 15, 357–372 (1997)

    Article  Google Scholar 

  8. Mirchandani, P.: The Multi-Tier Tree Problem. INFORMS Journal on Computing 8, 202–218 (1996)

    Article  MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  10. Promel, H., Steger, A.: A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio (\(\frac{5}{3}\)). Journal of Algorithms 36, 89–101 (2000)

    Google Scholar 

  11. Robins, G., Zelikovsky, A.: Improved Steiner Tree Approximation in Graphs. In: Proc. of ACM/SIAM Symposium on Discrete Algorithms (SODA 2000), pp. 770–779.

    Google Scholar 

  12. Takahashi, H., Matsuyama, A.: An Approximate Solution for the Steiner Problem in Graphs. Math. Japonica 6, 573–577 (1980)

    MathSciNet  Google Scholar 

  13. Xue, G., Lin, G.-H., Du, D.-Z.: Grade of Service Steiner Minimum Trees in the Euclidean Plane. Algorithmica 31, 479–500 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  14. Zelikovsky, A.: An 11/6-appraoximation algorithm for the network Steiner problem. Algorithmica 9, 463–470 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  15. Zelikovsky, A.: A faster approximation algorithm for the Steiner tree problem in graphs. Information Processing Letters 46, 79–83 (1993)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Bonn, Bonn, 53117, Germany

    Marek Karpinski

  2. Electrical and Computer Engineering Department, University of California at San Diego, La Jolla, CA, 92093-0114, USA

    Ion I. Măndoiu

  3. Department of Electrical Engineering, Georgia Institute of Technology, Atlanta, GA, 30332, USA

    Alexander Olshevsky

  4. Computer Science Department, Georgia State University, Atlanta, GA, 30303, USA

    Alexander Zelikovsky

Authors
  1. Marek Karpinski
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ion I. Măndoiu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Alexander Olshevsky
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Alexander Zelikovsky
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Carleton University, Ottawa, Canada

    Frank Dehne

  2. School of Computer Science, Carleton University, 1125 Colonel By Drive, K1S 5B6, Ottawa, Canada

    Jörg-Rüdiger Sack

  3. School of Computer Science, Carleton University, K1S 5B6, Ottawa, ON, Canada

    Michiel Smid

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Karpinski, M., Măndoiu, I.I., Olshevsky, A., Zelikovsky, A. (2003). Improved Approximation Algorithms for the Quality of Service Steiner Tree Problem. In: Dehne, F., Sack, JR., Smid, M. (eds) Algorithms and Data Structures. WADS 2003. Lecture Notes in Computer Science, vol 2748. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45078-8_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45078-8_35

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40545-0

  • Online ISBN: 978-3-540-45078-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation