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.
Cite
CITATION STYLE
APA
Chen, G., & Xue, G. (2001). An FPTAS for weight-constrained Steiner trees in series-parallel graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2108, pp. 519–528). Springer Verlag. https://doi.org/10.1007/3-540-44679-6_58
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free