Abstract
We investigate the Clustered Steiner tree problem on metric graphs, which is a variant of Steiner minimum tree problem. The required vertices are partitioned into clusters, and in a feasible clustered Steiner tree, the subtrees spanning two different clusters must be disjoint. In this paper, we show that the problem remains NP-hard even if the topologies of all clusters and the inter-cluster tree are given. We propose a (ρ + 2)-approximation algorithm for the general case, in which ρ is the approximation ratio for the Steiner tree problem. When the topologies for all clusters are given, we show a (ρ + 1)-approximation algorithm. We also discuss the Steiner ratio for this problem. We show the ratio is lower and upper bounded by three and four, respectively.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Agrawal, A., Klein, P., Ravi, R.: When trees collide: An approximation algorithm for the generalized Steiner problem in networks. SIAM Journal on Computing 24(3), 445–456 (1995)
Bao, X., Liu, Z.: An improved approximation algorithm for the clustered traveling salesman problem. Information Processing Letters 112, 908–910 (2012)
Byrka, J., Grandoni, F., Rothvoß, T., Sanitá, L.: An improved LP-based approximation for Steiner tree. In: Proc. 42nd ACM Symposium on Theory of Computing, pp. 583–592 (2010)
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)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press and McGraw-Hill (2001)
Drake, D.E., Hougardy, S.: On approximation algorithms for the terminal Steiner tree problem. Information Processing Letters 89(1), 15–18 (2004)
Fuchs, B.: A note on the terminal Steiner tree problem. Information Processing Letters 87, 219–220 (2003)
Garey, M.R., Graham, R., Johnson, D.: The complexity of computing Steiner minimal trees. SIAM Journal on Applied Mathematics 32, 835–859 (1977)
Garey, M.R., Johnson, D.: The rectilinear Steiner problem is NP-complete. SIAM Journal on Applied Mathematics 32, 826–834 (1977)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to The Theory of NP-Completeness. Freeman, NewYork (1979)
Garg, N., Konjevod, G., Ravi, R.: A polylogarithmic approximation algorithm for the group Steiner problem. In: Proc. 9th ACM-SIAM Symposium on Discrete Algorithms, pp. 253–259 (1998)
Guttmann-Beck, N., Hassin, R., Khuller, S., Raghavachari, B.: Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem. Algorithmica 28, 422–437 (2000)
Hsieh, S.Y., Yang, S.C.: Approximating the selected-internal Steiner tree. Theoretical Computer Science 381(1-3), 288–291 (2007)
Huang, C.W., Lee, C.W., Gao, H.M., Hsieh, S.Y.: The internal Steiner tree problem: Hardness and approximations. Journal of Complexity 29, 27–43 (2013)
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)
Li, X., Zou, F., Huang, Y., Kim, D., Wu, W.: A better constant-factor approximation for selected-internal Steiner minimum tree. Algorithmica 56, 333–341 (2010)
Lin, G.H., Xue, G.L.: On the terminal Steiner tree problem. Information Processing Letters 84(2), 103–107 (2002)
Lu, C.L., Tang, C.Y., Lee, R.C.T.: The full Steiner tree problem. Theoretical Computer Science 306(1-3), 55–67 (2003)
Martinez, F.V., de Pina, J.C., Soares, J.: Algorithms for terminal Steiner trees. Theoretical Computer Science 389, 133–142 (2007)
Robins, G., Zelikovsky, A.: Tighter bounds for graph Steiner tree approximation. SIAM Journal on Discrete Mathematics 19(1), 122–134 (2005)
Sebő, A.: Eight-fifth approximation for the path TSP. In: Goemans, M., Correa, J. (eds.) IPCO 2013. LNCS, vol. 7801, pp. 362–374. Springer, Heidelberg (2013)
Wu, B.Y., Chao, K.M.: Spanning Trees and Optimization Problems. Chapman & Hall (2004)
Zelikovsky, A.: An 11/6-approximation algorithm for the network Steiner problem. Algorithmica 9, 463–470 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer International Publishing Switzerland
About this paper
Cite this paper
Wu, B.Y. (2013). On the Clustered Steiner Tree Problem. In: Widmayer, P., Xu, Y., Zhu, B. (eds) Combinatorial Optimization and Applications. COCOA 2013. Lecture Notes in Computer Science, vol 8287. Springer, Cham. https://doi.org/10.1007/978-3-319-03780-6_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-03780-6_6
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-03779-0
Online ISBN: 978-3-319-03780-6
eBook Packages: Computer ScienceComputer Science (R0)