Steiner tree problem with minimum number of Steiner points and bounded edge-length
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. (C) 1999 Elsevier Science B.V. All rights reserved.
vlsi design wdm optimal networks wireless communications approximation algorithms algorithms steiner minimum trees