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 Citation (Scopus)

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 publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages519-528
Number of pages10
Volume2108
ISBN (Print)9783540424949
StatePublished - 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)03029743
ISSN (Electronic)16113349

Other

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

Fingerprint

FPTAS
Series-parallel Graph
Steiner Tree
Non-negative
Fully Polynomial Time Approximation Scheme
Integer
Costs
Computational complexity
NP-complete problem
Polynomials
Computing

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

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). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2108). Springer Verlag.

An FPTAS for weight-constrained Steiner trees in series-parallel graphs. / Chen, Guangting; Xue, Guoliang.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2108 Springer Verlag, 2001. p. 519-528 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2108).

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

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, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2108, Springer Verlag, pp. 519-528, 7th Annual International Conference on Computing and Combinatorics, COCOON 2001, Guilin, China, 8/20/01.
Chen G, Xue G. 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. Springer Verlag. 2001. p. 519-528. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Chen, Guangting ; Xue, Guoliang. / An FPTAS for weight-constrained Steiner trees in series-parallel graphs. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 2108 Springer Verlag, 2001. pp. 519-528 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@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",
year = "2001",
language = "English (US)",
isbn = "9783540424949",
volume = "2108",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "519--528",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

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

AU - Chen, Guangting

AU - Xue, Guoliang

PY - 2001

Y1 - 2001

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=48249084261&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=48249084261&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:48249084261

SN - 9783540424949

VL - 2108

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 519

EP - 528

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

PB - Springer Verlag

ER -