A PTAS for weight constrained Steiner trees in series-parallel graphs

Guangting Chen, Guoliang Xue

Research output: Contribution to journalArticle

10 Citations (Scopus)

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.

Original languageEnglish (US)
Pages (from-to)237-247
Number of pages11
JournalTheoretical Computer Science
Volume304
Issue number1-3
DOIs
StatePublished - Jul 28 2003

Fingerprint

Series-parallel Graph
Steiner Tree
Computational complexity
NP-complete problem
Steiner Tree Problem
Polynomial Time Approximation Scheme
Graph in graph theory
Polynomials
Costs

Keywords

  • Multiple constraints quality of service
  • Series-parallel graphs
  • Steiner trees

ASJC Scopus subject areas

  • Computational Theory and Mathematics

Cite this

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

In: Theoretical Computer Science, Vol. 304, No. 1-3, 28.07.2003, p. 237-247.

Research output: Contribution to journalArticle

@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",
year = "2003",
month = "7",
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",

}

TY - JOUR

T1 - A PTAS for weight constrained Steiner trees in series-parallel graphs

AU - Chen, Guangting

AU - Xue, Guoliang

PY - 2003/7/28

Y1 - 2003/7/28

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

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

KW - Multiple constraints quality of service

KW - Series-parallel graphs

KW - Steiner trees

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

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

U2 - 10.1016/S0304-3975(03)00088-4

DO - 10.1016/S0304-3975(03)00088-4

M3 - Article

AN - SCOPUS:0037811195

VL - 304

SP - 237

EP - 247

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 1-3

ER -