@inproceedings{1fc6d0824bd04b33b775dd0d2ab76b82,
title = "An FPTAS for weight-constrained Steiner trees in series-parallel graphs",
abstract = "In this paper, we study the problem of computing a minimum cost Steiner tree subject to weight constraint in a series-parallel graph where each edge has a nonnegative integer cost and a nonnegative integer weight. We present a fully polynomial time approximation scheme for this NP-complete problem.",
author = "Guangting Chen and Guoliang Xue",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2001.; 7th Annual International Conference on Computing and Combinatorics, COCOON 2001 ; Conference date: 20-08-2001 Through 23-08-2001",
year = "2001",
doi = "10.1007/3-540-44679-6\_58",
language = "English (US)",
isbn = "9783540424949",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "519--528",
editor = "Jie Wang",
booktitle = "Computing and Combinatorics - 7th Annual International Conference, COCOON 2001, Proceedings",
}