Abstract
Given a complete graph G = (V,E) with a length function on edges and a subset R of V, the terminal Steiner tree is defined to be a Steiner tree in G with all the vertices of R as its leaves. Then the terminal Steiner tree problem is to find a terminal Steiner tree in G with minimum length. In this paper, we present an approximation algorithm with performance ratio \(2\rho-\frac{(\rho\alpha^2-\alpha\rho)}{(\alpha+\alpha^2)(\rho-1)+2(\alpha-1)^2}\) for the terminal Steiner tree problem, where ρ is the best-known performance ratio for the Steiner tree problem with any α ≥ 2. When we let α = 3.87 ≈ 4, this result improves the previous performance ratio of 2.515 to 2.458.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Berman, P., Ramaiyer, V.: Improved Approximations for the Steiner Tree Problem. Journal of Algorithms 17, 381–408 (1994)
Bern, M., Plassmann, P.: The Steiner Tree Problem with Edge Lengths 1 and 2. Information Processing Letters 32, 171–176 (1989)
Borchers, A., Du, D.Z.: The k-Steiner Ratio in Graphs. SIAM Journal on Computing 26, 857–869 (1997)
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), pp. 4–11. ACM, Monterey (1998)
Chen, Y.H., Lu, C.L., Tang, C.Y.: On the Full and Bottleneck Full Steiner Tree Problems. In: Warnow, T.J., Zhu, B. (eds.) COCOON 2003. LNCS, vol. 2697, pp. 122–129. Springer, Heidelberg (2003)
Cheng, X., Du, D.Z.: Steiner Tree in Industry. Kluwer Academic Publishers, Dordrecht (2001)
Drake, D.E., Hougardy, S.: On Approximation Algorithms for the Terminal Steiner Tree Problem. Information Processing Letters 89, 15–18 (2004)
Du, D.Z., Smith, J.M., Rubinstein, J.H.: Advances in Steiner Tree. Kluwer Academic Publishers, Dordrecht (2000)
Du, D.Z., Hu, X.: Steiner Tree Problems in Computer Communication Networks. World Scientific Publishing Company, Singapore (2008)
Fuchs, B.: A Note on the Terminal Steiner Tree Problem. Information Processing Letters 87, 219–220 (2003)
Garey, M.R., Graham, R.L., Johnson, D.S.: The Complexity of Computing Steiner Minimal Trees. SIAM Journal of Applied Mathematics 32, 835–859 (1997)
Graur, D., Li, W.H.: Fundamentals of Molecular Evolution, 2nd edn. Sinauer Publishers, Sunderland (2000)
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), pp. 448–453. ACM/SIGACT-SIAM, Baltimore (1999)
Hsieh, S.Y., Gao, H.M.: On the Partial Terminal Steiner Tree Problem. The Journal of Supercomputing 41, 41–52 (2007)
Hsieh, S.Y., Yang, S.C.: Approximating the Selected-Internal Steiner Tree. Theoretical Computer Science 381, 288–291 (2007)
Hwang, F.K., Richards, D.S., Winter, P.: The Steiner Tree Problem. Annuals of Discrete Mathematics, vol. 53. North-Holland, Elsevier, Amsterdam (1992)
Kahng, A.B., Robins, G.: On Optimal Interconnections for VLSI. Kluwer Academic Publishers, Boston (1995)
Karpinski, M., Zelikovsky, A.: New Approximation Algorithms for the Steiner Tree Problems. Journal of Combinatorial Optimization 1, 47–65 (1997)
Kim, J., Warnow, T.: Tutorial on Phylogenetic Tree Estimation. Department of Ecology and Evolutionary Biology. Yale University, New Haven (1999) (manuscript)
Lin, G.H., Xue, G.L.: On the Terminal Steiner Tree Problem. Information Processing Letters 84, 103–107 (2002)
Lu, C.L., Tang, C.Y., Lee, R.C.T.: The Full Steiner Tree Problem. Theoretical Computer Science 306, 55–67 (2003)
Martineza, F.V., Pinab, J.C.D., Soares, J.: Algorithm for Terminal Steiner Trees. Theoretical Computer Science 389, 133–142 (2007)
Prommel, H.J., Steger, A.: A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3. Journal of Algorithms 36, 89–101 (2000)
Robins, G., Zelikovsky, A.: Improved Steiner Tree Approximation in Graphs. In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2000), pp. 770–779. ACM/SIGACT-SIAM, San Francisco (2000)
Robins, G., Zelikovsky, A.: Tighter Bounds for Graph Steiner Tree Approximation. SIAM Journal on Discrete Mathematics 19, 122–134 (2005)
Zelikovsky, A.: An 11/6-Approximation Algorithm for the Network Steiner Problem. Algorithmica 9, 463–470 (1993)
Zelikovsky, A.: A Faster Approximation Algorithm for the Steiner Tree Problem in Graphs. Information Processing Letters 46, 79–83 (1993)
Zelikovsky, A.: Better Approximation Bounds for the Network and Euclidean Steiner Tree Problems. Technical report CS-96-06, University of Virginia (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, Y.H. (2011). An Improved Approximation Algorithm for the Terminal Steiner Tree Problem. In: Murgante, B., Gervasi, O., Iglesias, A., Taniar, D., Apduhan, B.O. (eds) Computational Science and Its Applications - ICCSA 2011. ICCSA 2011. Lecture Notes in Computer Science, vol 6784. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21931-3_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-21931-3_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21930-6
Online ISBN: 978-3-642-21931-3
eBook Packages: Computer ScienceComputer Science (R0)