Approximating the selected-internal Steiner tree


In this paper, we consider a variant of the well-known Steiner tree problem. Given a complete graph G = (V, E) with a cost function c : E → R and two subsets R and R satisfying R ⊂ R ⊆ V , a selected-internal Steiner tree is a Steiner tree which contains (or spans) all the vertices in R such that each vertex in R cannot be a leaf. The selected-internal… (More)
DOI: 10.1016/j.tcs.2007.05.035


Cite this paper

@article{Hsieh2007ApproximatingTS, title={Approximating the selected-internal Steiner tree}, author={Sun-Yuan Hsieh and Shih-Cheng Yang}, journal={Theor. Comput. Sci.}, year={2007}, volume={381}, pages={288-291} }