TY - JOUR
T1 - On the terminal Steiner tree problem
AU - Lin, Guohui
AU - Xue, Guoliang
N1 - Funding Information:
* Corresponding author. E-mail addresses: ghlin@cs.ualberta.ca (G. Lin), xue@asu.edu (G. Xue). 1 Research supported in part by Startup grant G227120195 from the University of Alberta. 2 Research supported in part by ARO grant DAAD19-00-1-0377 and DOE grant DE-FG02-00ER45828.
PY - 2002/10/31
Y1 - 2002/10/31
N2 - 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.
AB - 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.
KW - Approximation algorithms
KW - Steiner minimum tree
KW - Terminal Steiner tree
UR - http://www.scopus.com/inward/record.url?scp=0037206566&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0037206566&partnerID=8YFLogxK
U2 - 10.1016/S0020-0190(02)00227-2
DO - 10.1016/S0020-0190(02)00227-2
M3 - Article
AN - SCOPUS:0037206566
VL - 84
SP - 103
EP - 107
JO - Information Processing Letters
JF - Information Processing Letters
SN - 0020-0190
IS - 2
ER -