On the terminal Steiner tree problem

Abstract

We investigate a practical variant of the well-known graph Steiner tree problem. In this variant, every target vertex is required to be a leaf vertex in the solution Steiner tree. We present hardness results for this variant as well as a polynomial time approximation algorithm with performance ratio ρ + 2, where ρ is the best-known approximation ratio for the graph Steiner tree problem.  2002 Elsevier Science B.V. All rights reserved.

DOI: 10.1016/S0020-0190(02)00227-2

2 Figures and Tables

Statistics

0510'04'06'08'10'12'14'16
Citations per Year

51 Citations

Semantic Scholar estimates that this publication has 51 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Lin2002OnTT, title={On the terminal Steiner tree problem}, author={Guohui Lin and Guoliang Xue}, journal={Inf. Process. Lett.}, year={2002}, volume={84}, pages={103-107} }