Approximations for Steiner trees with minimum number of Steiner points

Donghui Chen, Ding Zhu Du, Xiao Dong Hu, Guo Hui Lin, Lusheng Wang, Guoliang Xue

Research output: Contribution to journalArticle

48 Citations (Scopus)

Abstract

Given n terminals in the Euclidean plane and a positive constant, find a Steiner tree interconnecting all terminals with the minimum number of Steiner points such that the Euclidean length of each edge is no more than the given positive constant. This problem is NP-hard with applications in VLSI design, WDM optical networks and wireless communications. In this paper, we show that (a) the Steiner ratio is 1/4, that is, the minimum spanning tree yields a polynomial-time approximation with performance ratio exactly 4, (b) there exists a polynomial-time approximation with performance ratio 3, and (c) there exists a polynomial-time approximation scheme under certain conditions.

Original languageEnglish (US)
Pages (from-to)83-99
Number of pages17
JournalTheoretical Computer Science
Volume262
Issue number1-2
DOIs
StatePublished - 2001
Externally publishedYes

Fingerprint

Steiner Point
Steiner Tree
Polynomial time
Steiner Ratio
Polynomials
Optical Wireless
VLSI Design
WDM Networks
Polynomial Time Approximation Scheme
Network Communication
Euclidean plane
Optical Communication
Minimum Spanning Tree
Optical Networks
Approximation
Wireless Communication
Euclidean
NP-complete problem
Fiber optic networks
Wavelength division multiplexing

Keywords

  • Approximation algorithms
  • Steiner trees
  • VLSI design
  • WDM optical networks

ASJC Scopus subject areas

  • Computational Theory and Mathematics

Cite this

Approximations for Steiner trees with minimum number of Steiner points. / Chen, Donghui; Du, Ding Zhu; Hu, Xiao Dong; Lin, Guo Hui; Wang, Lusheng; Xue, Guoliang.

In: Theoretical Computer Science, Vol. 262, No. 1-2, 2001, p. 83-99.

Research output: Contribution to journalArticle

Chen, Donghui ; Du, Ding Zhu ; Hu, Xiao Dong ; Lin, Guo Hui ; Wang, Lusheng ; Xue, Guoliang. / Approximations for Steiner trees with minimum number of Steiner points. In: Theoretical Computer Science. 2001 ; Vol. 262, No. 1-2. pp. 83-99.
@article{22c8287b85f844ffb0af1faf82e59832,
title = "Approximations for Steiner trees with minimum number of Steiner points",
abstract = "Given n terminals in the Euclidean plane and a positive constant, find a Steiner tree interconnecting all terminals with the minimum number of Steiner points such that the Euclidean length of each edge is no more than the given positive constant. This problem is NP-hard with applications in VLSI design, WDM optical networks and wireless communications. In this paper, we show that (a) the Steiner ratio is 1/4, that is, the minimum spanning tree yields a polynomial-time approximation with performance ratio exactly 4, (b) there exists a polynomial-time approximation with performance ratio 3, and (c) there exists a polynomial-time approximation scheme under certain conditions.",
keywords = "Approximation algorithms, Steiner trees, VLSI design, WDM optical networks",
author = "Donghui Chen and Du, {Ding Zhu} and Hu, {Xiao Dong} and Lin, {Guo Hui} and Lusheng Wang and Guoliang Xue",
year = "2001",
doi = "10.1016/S0304-3975(00)00182-1",
language = "English (US)",
volume = "262",
pages = "83--99",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",
number = "1-2",

}

TY - JOUR

T1 - Approximations for Steiner trees with minimum number of Steiner points

AU - Chen, Donghui

AU - Du, Ding Zhu

AU - Hu, Xiao Dong

AU - Lin, Guo Hui

AU - Wang, Lusheng

AU - Xue, Guoliang

PY - 2001

Y1 - 2001

N2 - Given n terminals in the Euclidean plane and a positive constant, find a Steiner tree interconnecting all terminals with the minimum number of Steiner points such that the Euclidean length of each edge is no more than the given positive constant. This problem is NP-hard with applications in VLSI design, WDM optical networks and wireless communications. In this paper, we show that (a) the Steiner ratio is 1/4, that is, the minimum spanning tree yields a polynomial-time approximation with performance ratio exactly 4, (b) there exists a polynomial-time approximation with performance ratio 3, and (c) there exists a polynomial-time approximation scheme under certain conditions.

AB - Given n terminals in the Euclidean plane and a positive constant, find a Steiner tree interconnecting all terminals with the minimum number of Steiner points such that the Euclidean length of each edge is no more than the given positive constant. This problem is NP-hard with applications in VLSI design, WDM optical networks and wireless communications. In this paper, we show that (a) the Steiner ratio is 1/4, that is, the minimum spanning tree yields a polynomial-time approximation with performance ratio exactly 4, (b) there exists a polynomial-time approximation with performance ratio 3, and (c) there exists a polynomial-time approximation scheme under certain conditions.

KW - Approximation algorithms

KW - Steiner trees

KW - VLSI design

KW - WDM optical networks

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

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

U2 - 10.1016/S0304-3975(00)00182-1

DO - 10.1016/S0304-3975(00)00182-1

M3 - Article

AN - SCOPUS:0034911862

VL - 262

SP - 83

EP - 99

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 1-2

ER -