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

被引：220
|
作者：
Lin, GH
Xue, GL [1 ]
机构：
[1] Univ Vermont, Dept Comp Sci, Burlington, VT 05405 USA
[2] Chinese Acad Sci, Inst Appl Math, Beijing 100080, Peoples R China
来源：
INFORMATION PROCESSING LETTERS | 1999年 / 69卷 / 02期
基金：
美国国家科学基金会;
关键词：
algorithms; approximation algorithms; Steiner minimum trees; VLSI design; WDM optimal networks; wireless communications;
D O I：
10.1016/S0020-0190(98)00201-4
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
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.
引用
下载
收藏
页码：53 / 57
页数：5
相关论文
共 50 条
  • [1] A note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points
    Mandoiu, II
    Zelikovsky, AZ
    INFORMATION PROCESSING LETTERS, 2000, 75 (04) : 165 - 167
  • [2] An improved algorithm for the Steiner tree problem with bounded edge-length
    Chen, Chi-Yeh
    Hsieh, Sun-Yuan
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2022, 123 : 20 - 36
  • [3] An efficient 3-approximation algorithm for the Steiner tree problem with the minimum number of Steiner points and bounded edge length
    Shin, Donghoon
    Choi, Sunghee
    PLOS ONE, 2023, 18 (11):
  • [4] The Euclidean bottleneck Steiner tree and Steiner tree with minimum number of Steiner points
    Du, DZ
    Wang, LS
    Xu, BA
    COMPUTING AND COMBINATORICS, 2001, 2108 : 509 - 518
  • [5] Approximation algorithm for solving the 1-line Steiner tree problem with minimum number of Steiner points
    Liu, Suding
    OPTIMIZATION LETTERS, 2024, 18 (06) : 1421 - 1435
  • [6] Bottleneck Steiner tree with bounded number of Steiner vertices
    Abu-Affash, A. Karim
    Carmi, Paz
    Katz, Matthew J.
    JOURNAL OF DISCRETE ALGORITHMS, 2015, 30 : 96 - 100
  • [7] 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
    Journal of Global Optimization, 2000, 18 : 17 - 33
  • [8] Approximations for Steiner trees with minimum number of Steiner points
    Chen, DH
    Du, DZ
    Hu, XD
    Lin, GH
    Wang, LS
    Xue, GL
    THEORETICAL COMPUTER SCIENCE, 2001, 262 (1-2) : 83 - 99
  • [9] Approximations for Steiner trees with minimum number of Steiner points
    Chen, DG
    Du, DZ
    Hu, XD
    Lin, GH
    Wang, LS
    Xue, GL
    JOURNAL OF GLOBAL OPTIMIZATION, 2000, 18 (01) : 17 - 33
  • [10] Approximating Steiner Trees and Forests with Minimum Number of Steiner Points
    Cohen, Nachshon
    Nutov, Zeev
    APPROXIMATION AND ONLINE ALGORITHMS, WAOA 2014, 2015, 8952 : 95 - 106
12345