Advertisement

Improved Approximation Algorithms for the Quality of Service Steiner Tree Problem

  • Marek Karpinski
  • Ion I. Măndoiu
  • Alexander Olshevsky
  • Alexander Zelikovsky
Part of the Lecture Notes in Computer Science book series (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.

Keywords

Approximation Algorithm Approximation Ratio Steiner Tree Steiner Point Steiner Tree Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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)zbMATHCrossRefGoogle Scholar
  2. 2.
    Balakrishnan, A., Magnanti, T.L., Mirchandani, P.: Heuristics, LPs, and Trees on Trees: Network Design Analyses. Operations Research 44, 478–496 (1996)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 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. 4.
    Borchers, A., Du, D.Z.: The k-Steiner Ratio in Graphs. SIAM Journal on Computing 26, 857–869 (1997)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 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. 6.
    Current, J.R., Revelle, C.S., Cohon, J.L.: The Hierarchical Network Design Problem. European Journal of Operations Research 27, 57–66 (1986)zbMATHCrossRefGoogle Scholar
  7. 7.
    Maxemchuk, N.: Video Distribution on Multicast Networks. IEEE Journal on Selected Issues in Communications 15, 357–372 (1997)CrossRefGoogle Scholar
  8. 8.
    Mirchandani, P.: The Multi-Tier Tree Problem. INFORMS Journal on Computing 8, 202–218 (1996)zbMATHCrossRefGoogle Scholar
  9. 9.
    Mehlhorn, K.: A faster approximation algorithm for the Steiner problem in graphs. Information Processing Letters 27, 125–128 (1988)zbMATHCrossRefMathSciNetGoogle Scholar
  10. 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. 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. 12.
    Takahashi, H., Matsuyama, A.: An Approximate Solution for the Steiner Problem in Graphs. Math. Japonica 6, 573–577 (1980)MathSciNetGoogle Scholar
  13. 13.
    Xue, G., Lin, G.-H., Du, D.-Z.: Grade of Service Steiner Minimum Trees in the Euclidean Plane. Algorithmica 31, 479–500 (2001)zbMATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    Zelikovsky, A.: An 11/6-appraoximation algorithm for the network Steiner problem. Algorithmica 9, 463–470 (1993)zbMATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Zelikovsky, A.: A faster approximation algorithm for the Steiner tree problem in graphs. Information Processing Letters 46, 79–83 (1993)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Marek Karpinski
    • 1
  • Ion I. Măndoiu
    • 2
  • Alexander Olshevsky
    • 3
  • Alexander Zelikovsky
    • 4
  1. 1.Department of Computer ScienceUniversity of BonnBonnGermany
  2. 2.Electrical and Computer Engineering DepartmentUniversity of California at San DiegoLa JollaUSA
  3. 3.Department of Electrical EngineeringGeorgia Institute of TechnologyAtlantaUSA
  4. 4.Computer Science DepartmentGeorgia State UniversityAtlantaUSA

Personalised recommendations