Steiner tree problem with minimum number of Steiner points and bounded edge-length

Guo Hui Lin; Guoliang Xue

doi:10.1016/s0020-0190(98)00201-4

Steiner tree problem with minimum number of Steiner points and bounded edge-length

Guo Hui Lin, Guoliang Xue

Research output: Contribution to journal › Article › peer-review

252 Scopus citations

Abstract

In this paper, we study the Steiner tree problem with minimum number of Steiner points and bounded edge-length (STP-MSPBEL), which asks for a tree interconnecting a given set of n terminal points and a minimum number of Steiner points such that the Euclidean length of each edge is no more than a given positive constant. This problem has applications in VLSI design, WDM optimal networks and wireless communications. We prove that this problem is NP-complete and present a polynomial time approximation algorithm whose worst-case performance ratio is 5.

Original language	English (US)
Pages (from-to)	53-57
Number of pages	5
Journal	Information Processing Letters
Volume	69
Issue number	2
DOIs	https://doi.org/10.1016/s0020-0190(98)00201-4
State	Published - Jan 29 1999
Externally published	Yes

Keywords

Algorithms
Approximation algorithms
Steiner minimum trees
VLSI design
WDM optimal networks
Wireless communications

ASJC Scopus subject areas

Theoretical Computer Science
Signal Processing
Information Systems
Computer Science Applications

Access to Document

10.1016/s0020-0190(98)00201-4

Cite this

@article{5118e0dd0ebd4c29a7d9c5eb82ec667b,

title = "Steiner tree problem with minimum number of Steiner points and bounded edge-length",

abstract = "In this paper, we study the Steiner tree problem with minimum number of Steiner points and bounded edge-length (STP-MSPBEL), which asks for a tree interconnecting a given set of n terminal points and a minimum number of Steiner points such that the Euclidean length of each edge is no more than a given positive constant. This problem has applications in VLSI design, WDM optimal networks and wireless communications. We prove that this problem is NP-complete and present a polynomial time approximation algorithm whose worst-case performance ratio is 5.",

keywords = "Algorithms, Approximation algorithms, Steiner minimum trees, VLSI design, WDM optimal networks, Wireless communications",

author = "Lin, {Guo Hui} and Guoliang Xue",

note = "Funding Information: * Corresponding author. Email: xue@cs.uvm.edu. The research of this author was supported in part by the Army Research Office grant DAAH@4-96-10233 and by the National Science Foundation grants ASC-9409285 and OSR-9350540. {\textquoteright} Email: ghlin@cs.uvm.edu. The research of this author was supported in part by the Army Research Office grant DAAHW-96.10233, and by the Presidential Chuang Xin Foundation of the Chinese Academy of Sciences.",

year = "1999",

month = jan,

day = "29",

doi = "10.1016/s0020-0190(98)00201-4",

language = "English (US)",

volume = "69",

pages = "53--57",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier",

number = "2",

}

TY - JOUR

T1 - Steiner tree problem with minimum number of Steiner points and bounded edge-length

AU - Lin, Guo Hui

AU - Xue, Guoliang

N1 - Funding Information: * Corresponding author. Email: xue@cs.uvm.edu. The research of this author was supported in part by the Army Research Office grant DAAH@4-96-10233 and by the National Science Foundation grants ASC-9409285 and OSR-9350540. ’ Email: ghlin@cs.uvm.edu. The research of this author was supported in part by the Army Research Office grant DAAHW-96.10233, and by the Presidential Chuang Xin Foundation of the Chinese Academy of Sciences.

PY - 1999/1/29

Y1 - 1999/1/29

N2 - In this paper, we study the Steiner tree problem with minimum number of Steiner points and bounded edge-length (STP-MSPBEL), which asks for a tree interconnecting a given set of n terminal points and a minimum number of Steiner points such that the Euclidean length of each edge is no more than a given positive constant. This problem has applications in VLSI design, WDM optimal networks and wireless communications. We prove that this problem is NP-complete and present a polynomial time approximation algorithm whose worst-case performance ratio is 5.

AB - In this paper, we study the Steiner tree problem with minimum number of Steiner points and bounded edge-length (STP-MSPBEL), which asks for a tree interconnecting a given set of n terminal points and a minimum number of Steiner points such that the Euclidean length of each edge is no more than a given positive constant. This problem has applications in VLSI design, WDM optimal networks and wireless communications. We prove that this problem is NP-complete and present a polynomial time approximation algorithm whose worst-case performance ratio is 5.

KW - Algorithms

KW - Approximation algorithms

KW - Steiner minimum trees

KW - VLSI design

KW - WDM optimal networks

KW - Wireless communications

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

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

U2 - 10.1016/s0020-0190(98)00201-4

DO - 10.1016/s0020-0190(98)00201-4

M3 - Article

AN - SCOPUS:0032755118

SN - 0020-0190

VL - 69

SP - 53

EP - 57

JO - Information Processing Letters

JF - Information Processing Letters

IS - 2

ER -

Steiner tree problem with minimum number of Steiner points and bounded edge-length

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this