An FPTAS for weight-constrained Steiner trees in series-parallel graphs

Guangting Chen, Guoliang Xue

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

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.

Original languageEnglish (US)
Title of host publicationComputing and Combinatorics - 7th Annual International Conference, COCOON 2001, Proceedings
EditorsJie Wang
PublisherSpringer Verlag
Pages519-528
Number of pages10
ISBN (Print)9783540424949
StatePublished - Jan 1 2001
Externally publishedYes
Event7th Annual International Conference on Computing and Combinatorics, COCOON 2001 - Guilin, China
Duration: Aug 20 2001Aug 23 2001

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2108
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other7th Annual International Conference on Computing and Combinatorics, COCOON 2001
CountryChina
CityGuilin
Period8/20/018/23/01

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'An FPTAS for weight-constrained Steiner trees in series-parallel graphs'. Together they form a unique fingerprint.

  • Cite this

    Chen, G., & Xue, G. (2001). An FPTAS for weight-constrained Steiner trees in series-parallel graphs. In J. Wang (Ed.), Computing and Combinatorics - 7th Annual International Conference, COCOON 2001, Proceedings (pp. 519-528). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2108). Springer Verlag.