Skip to main content
SpringerLink
Log in

On the Full and Bottleneck Full Steiner Tree Problems

  • Conference paper
  • First Online:
Computing and Combinatorics (COCOON 2003)

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

Included in the following conference series:

Abstract

Given a graph G = (V, E) with a length function on edges and a subset R of V, the full Steiner tree is defined to be a Steiner tree in G with all the vertices of R as its leaves. Then the full Steiner tree problem is to find a full Steiner tree in G with minimum length, and the bottleneck full Steiner tree problem is to find a full Steiner tree T in G such that the length of the largest edge in T is minimized. In this paper, we present a new approximation algorithm with performance ratio 2ρ for the full Steiner tree problem, where ρ is the best-known performance ratio for the Steiner tree problem. Moreover, we give an exact algorithm of O(|E| log |E|) time to solve the bottleneck full Steiner tree problem.

This work was partly supported by the National Science Council of the Republic of China under grants NSC91-2321-B-007-002 and NSC91-2213-E-321-001.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Berman, P., Ramaiyer, V.: Improved approximations for the Steiner tree problem. Journal of Algorithms 17 (1994) 381–408.

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  3. Caldwell, A., Kahng, A., Mantik, S., Markov, I., Zelikovsky, A.: On wirelength estimations for row-based placement. In: Proceedings of the 1998 International Symposium on Physical Design (ISPD 1998) 4–11.

    Google Scholar 

  4. Cheng, X., Du, D.Z.: Steiner Tree in Industry. Kluwer Academic Publishers, Dordrecht, Netherlands (2001).

    Google Scholar 

  5. Chiang, C., Sarrafzadeh, M., Wong, C.K.: Global router based on Steiner min-max trees. IEEE Transaction on Computer-Aided Design 9 (1990) 1318–1325.

    Article  Google Scholar 

  6. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithm. 2nd edition MIT Press, Cambridge (2001).

    Google Scholar 

  7. Du, D.Z., Smith, J.M., Rubinstein, J.H.: Advances in Steiner Tree. Kluwer Academic Publishers, Dordrecht, Netherlands (2000).

    Google Scholar 

  8. Duin, C.W., Volgenant, A.: The partial sum criterion for Steiner trees in graphs and shortest paths. European Journal of Operations Research 97 (1997) 172–182.

    Article  MATH  Google Scholar 

  9. Garey, M.R., Graham, R.L., Johnson, D.S.: The complexity of computing Steiner minimal trees. SIAM Journal of Applied Mathematics 32 (1997) 835–859.

    Article  MathSciNet  Google Scholar 

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

    Google Scholar 

  11. Hougardy, S., Prommel, H.J.: A 1.598 approximation algorithm for the Steiner problem in graphs. In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1999) 448–453.

    Google Scholar 

  12. Hwang, F.K., Richards, D.S., Winter, P.: The Steiner Tree Problem. Annuals of Discrete Mathematics 53, Elsevier Science Publishers, Amsterdam (1992).

    Google Scholar 

  13. Kahng, A.B., Robins, G.: On Optimal Interconnections for VLSI. Kluwer Publishers (1995).

    Google Scholar 

  14. Karpinski, M., Zelikovsky, A.: New approximation algorithms for the Steiner tree problems. Journal of Combinatorial Optimization 1 (1997) 47–65.

    Article  MATH  MathSciNet  Google Scholar 

  15. Kim, J., Warnow, T.: Tutorial on Phylogenetic Tree Estimation. Manuscript, Department of Ecology and Evolutionary Biology, Yale University (1999).

    Google Scholar 

  16. Lin, G.H., Xue, G.L.: On the terminal Steiner tree problem. Information Processing Letters 84 (2002) 103–107.

    Article  MATH  MathSciNet  Google Scholar 

  17. Lu, C.L., Tang, C.Y., Lee, R.C.T.: The full Steiner tree problem. Theoretical Computer Science (to appear).

    Google Scholar 

  18. Prommel, H.J., Steger, A.: A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3. Journal of Algorithms 36 (2000) 89–101.

    Article  MathSciNet  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 2000) 770–779.

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  22. Zelikovsky, A.: Better approximation bounds for the network and Euclidean Steiner tree problems. Technical report CS-96-06, University of Virginia (1996).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, National Tsing Hua University, Hsinchu, 300, Taiwan, R.O.C

    Yen Hung Chen & Chuan Yi Tang

  2. Department of Biological Science and Technology, National Chiao Tung University, Hsinchu, 300, Taiwan, R.O.C

    Chin Lung Lu

Authors
  1. Yen Hung Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chin Lung Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Chuan Yi Tang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Texas at Austin, One University Station, C0500, Austin, TX, 78712, USA

    Tandy Warnow

  2. Department of Computer Science, Montana State University, EPS 357, Bozeman, MT, 59717, USA

    Binhai Zhu

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, Y.H., Lu, C.L., Tang, C.Y. (2003). On the Full and Bottleneck Full Steiner Tree Problems. In: Warnow, T., Zhu, B. (eds) Computing and Combinatorics. COCOON 2003. Lecture Notes in Computer Science, vol 2697. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45071-8_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-45071-8_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40534-4

  • Online ISBN: 978-3-540-45071-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation