Advertisement

On the Internal Steiner Tree Problem

  • Sun-Yuan Hsieh
  • Huang-Ming Gao
  • Shih-Cheng Yang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4484)

Abstract

Given a complete graph G = (V,E)with a cost function c : E →ℝ +  and a vertex subset R ⊂ V, an internal Steiner tree is a Steiner tree which contains all vertices in R such that each vertex in R is restricted to be an internal vertex. The internal Steiner tree problem is to find an internal Steiner tree T whose total costs ∑ (u,v) ∈ E(T) c(u,v) is minimum. In this paper, we first show that the internal Steiner tree problem is MAX SNP-hard. We then present an approximation algorithm with approximation ratio 2ρ + 1 for the problem, where ρ is the best known approximation ratio for the Steiner tree problem.

Keywords

Approximation Algorithm Approximation Ratio Steiner Tree Internal Vertex 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.
    Arora, S., et al.: Proof verification and the hardness of approximation problems. Journal of the Association for Computing Machinery 45, 501–555 (1998)zbMATHMathSciNetGoogle Scholar
  2. 2.
    Bern, M., Plassmann, P.: The Steiner problem with edge lengths 1 and 2. Information Processing Letters 32(4), 171–176 (1989)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Cheng, X., Du, D.Z.: Steiner Trees in Industry. Kluwer Academic Publishers, Dordrecht (2001)Google Scholar
  4. 4.
    Cormen, T.H., et al.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)zbMATHGoogle Scholar
  5. 5.
    Du, D.Z., Smith, J.M., Rubinstein, J.H.: Advance in Steiner Tree. Kluwer Academic Publishers, Dordrecht (2000)Google Scholar
  6. 6.
    Garey, M., Graham, R., Johnson, D.: The complexity of computing Steiner minimal trees. SIAM Journal on Applied Mathematics 32, 835–859 (1977)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Garey, M., Johnson, D.: The rectilinear Steiner problem is NP-complete. SIAM Journal on Applied Mathematics 32, 826–834 (1977)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Hwang, F.K., Richards, D.S., Winter, P.: The Steiner Tree Problem. Annals of Discrete Mathematics, vol. 53. Elsevier Science Publishers, Amsterdam (1992)zbMATHGoogle Scholar
  9. 9.
    Karp, R.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85–103. Plenum Press, New York (1972)Google Scholar
  10. 10.
    Papadimitriou, C.H., Yannakakis, M.: Optimization, approximation, and complexity classes. In: Proceedings of the 20th ACM Symposium on Theory of Computing, pp. 229–234 (1988)Google Scholar
  11. 11.
    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)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Sun-Yuan Hsieh
    • 1
  • Huang-Ming Gao
    • 1
  • Shih-Cheng Yang
    • 1
  1. 1.Department of Computer Science and Information Engineering, National Cheng Kung University, No.1, University Road, Tainan 70101Taiwan

Personalised recommendations