Skip to main content
SpringerLink
Log in

A Better Constant-Factor Approximation for Selected-Internal Steiner Minimum Tree

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

The selected-internal Steiner minimum tree problem is a generalization of original Steiner minimum tree problem. Given a weighted complete graph G=(V,E) with weight function c, and two subsets R ′ ⊊ R⊆V with |R−R ′|≥2, selected-internal Steiner minimum tree problem is to find a minimum subtree T of G interconnecting R such that any leaf of T does not belong to R ′. In this paper, suppose c is metric, we obtain a (1+ρ)-approximation algorithm for this problem, where ρ is the best-known approximation ratio for the Steiner minimum tree problem.

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

  1. Borchers, A., Du, D.Z.: The k-Steiner ratio in graphs. SIAM J. Comput. 26, 857–869 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  2. Cheng, X., Du, D.Z.: Steiner Trees in Industry. Kluwer Academic, Dordrecht (2001)

    Google Scholar 

  3. Drake, D.E., Hougardy, S.: On approximation algorithms for the terminal Steiner tree problem. Inf. Process. Lett. 89, 15–18 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  4. Du, D.Z.: On component-size bounded Steiner trees. Discrete Appl. Math. 60, 131–140 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  5. Du, D.Z., Smith, J.M., Rubinstein, J.H.: Advance in Steiner Tree. Kluwer Academic, Dordrecht (2000)

    Google Scholar 

  6. Foulds, L., Graham, R.: The Steiner problem in phylogeny is NP-complete. Adv. Appl. Math. 3, 43–49 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  7. Fuchs, B.: A note on the terminal Steiner tree problem. Inf. Process. Lett. 87, 219–220 (2003)

    Article  MATH  Google Scholar 

  8. Garey, M., Johnson, D.: The rectilinear Steiner problem is NP-complete. SIAM J. Appl. Math. 32, 826–834 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  9. Garey, M., Graham, R., Johnson, D.: The complexity of computing Steriner minimal tree. SIAM J. Appl. Math. 32, 835–859 (1997)

    Article  MathSciNet  Google Scholar 

  10. Graur, D., Li, W.H.: Fundamentals of Molecular Evolution, 2nd edn. Sinauer, Sunderland (2000)

    Google Scholar 

  11. Hsieh, S.Y., Gao, H.M.: On the partial-terminal Steiner tree problem. J. Supercomput. 41, 41–52 (2007)

    Article  Google Scholar 

  12. Hsieh, S.Y., Yang, S.C.: Approximating the selected-internal Steiner tree. Theor. Comput. Sci. 381, 288–291 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  13. Hwang, F.K., Richards, D.S., Winter, P.: The Steiner Tree Problem. North-Holland, Amsterdam (1992)

    MATH  Google Scholar 

  14. Kahng, A.B., Robins, G.: On optimal Interconnections for VLSI. Kluwer Academic, Dordrecht (1995)

    MATH  Google Scholar 

  15. Korte, B., Prömel, H.J., Steger, A.: Steiner Trees in VLSI-Layouts. In: Korte, B., (eds.) Paths, Flows and VLSI-Layout. Springer, New York (1990)

    Google Scholar 

  16. Lin, G., Xue, G.: On the terminal Steiner tree problem. Inf. Process. Lett. 84, 103–107 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  17. Lu, C.L., Tang, C.Y., Lee, R.C.T.: The full Steiner tree problem. Theor. Comput. Sci. 306, 55–67 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  18. Martineza, F.V., Pinab, J.C.D., Soares, J.: Algorithm for terminal Steiner trees. Theor. Comput. Sci. 389, 133–142 (2007)

    Article  Google Scholar 

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

Download references

Author information

Authors and Affiliations

  1. School of Mathematics and Statistics, Lanzhou University, Lanzhou, Gansu, 730000, P.R. China

    Xianyue Li

  2. Department of Computer Science, University of Texas at Dallas, Richardson, TX, 75080, USA

    Feng Zou, Yaochun Huang, Donghyun Kim & Weili Wu

Authors
  1. Xianyue Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Feng Zou
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yaochun Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Donghyun Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Weili Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xianyue Li.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Li, X., Zou, F., Huang, Y. et al. A Better Constant-Factor Approximation for Selected-Internal Steiner Minimum Tree. Algorithmica 56, 333–341 (2010). https://doi.org/10.1007/s00453-009-9301-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-009-9301-8

Keywords

Search

Navigation