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

Guo Hui Lin, Guoliang Xue

Research output: Contribution to journalArticle

230 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 languageEnglish (US)
Pages (from-to)53-57
Number of pages5
JournalInformation Processing Letters
Volume69
Issue number2
StatePublished - Jan 29 1999
Externally publishedYes

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

Fingerprint Dive into the research topics of 'Steiner tree problem with minimum number of Steiner points and bounded edge-length'. Together they form a unique fingerprint.

  • Cite this