Abstract
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 Steiner minimum tree T of G spanning 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. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Li, X., Huang, Y., Zou, F., Kim, D., & Wu, W. (2008). (1 + ρ)-approximation for selected-internal Steiner minimum tree. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5092 LNCS, pp. 568–576). https://doi.org/10.1007/978-3-540-69733-6_56
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
