@article{45d1298cbed345db8ac0d1889c0ed038,
title = "A PTAS for weight constrained Steiner trees in series-parallel graphs",
abstract = "A study was performed on a PTAS for weight constrained Steiner trees in series-parallel graphs. A strongly polynomial time approximation scheme for the NP-complete problem was presented. It was found that weight constrained minimum cost Steiner tree problem (WCSTP) was NP-hard even when the graph was an S-P graph.",
keywords = "Multiple constraints quality of service, Series-parallel graphs, Steiner trees",
author = "Guangting Chen and Guoliang Xue",
note = "Funding Information: ∗Corresponding author. E-mail addresses: gtchen@mail.hz.zj.cn (Guangting Chen), xue@cse.asu.edu (Guoliang Xue). 1Supported in part by Chinese NSF grant CNSF19971078 and Chinese Institute of Electronic Science grant 57-7-3-7. 2Supported in part by ARO grant DAAD19-00-1-0377 and by DOE grant DE-FG02-00ER45828. A preliminary version of this paper was presented at COCOON{\textquoteright}01 where we presented a PTAS whose running time also depends on the input size of the problem.",
year = "2003",
month = jul,
day = "28",
doi = "10.1016/S0304-3975(03)00088-4",
language = "English (US)",
volume = "304",
pages = "237--247",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",
number = "1-3",
}