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

Guangting Chen, Guoliang Xue

Research output: Contribution to journalArticlepeer-review

10 Scopus citations

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

Keywords

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

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

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

Cite this