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 条
  • [41] DYNAMIC STEINER TREE PROBLEM
    IMASE, M
    WAXMAN, BM
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 1991, 4 (03) : 369 - 384
  • [42] On the clustered Steiner tree problem
    Wu, Bang Ye
    Lin, Chen-Wan
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2015, 30 (02) : 370 - 386
  • [43] On the approximability of the Steiner tree problem
    Thimm, M
    THEORETICAL COMPUTER SCIENCE, 2003, 295 (1-3) : 387 - 402
  • [44] A CONSTRAINED STEINER TREE PROBLEM
    ROSENWEIN, MB
    WONG, RT
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1995, 81 (02) : 430 - 439
  • [45] On the internal Steiner tree problem
    Hsieh, Sun-Yuan
    Gao, Huang-Ming
    Yang, Shih-Cheng
    THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS, 2007, 4484 : 274 - +
  • [46] On the clustered Steiner tree problem
    Bang Ye Wu
    Chen-Wan Lin
    Journal of Combinatorial Optimization, 2015, 30 : 370 - 386
  • [47] On the approximability of the Steiner tree problem
    Thimm, M
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2001, 2001, 2136 : 678 - 689
  • [48] On the terminal Steiner tree problem
    Lin, GH
    Xue, GL
    INFORMATION PROCESSING LETTERS, 2002, 84 (02) : 103 - 107
  • [49] The Bursty Steiner Tree Problem
    Sharma, Gokarna
    Busch, Costas
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2017, 28 (07) : 869 - 887
  • [50] The full Steiner tree problem
    Lu, CL
    Tang, CY
    Lee, RCT
    THEORETICAL COMPUTER SCIENCE, 2003, 306 (1-3) : 55 - 67
12345