Approximations for Steiner Trees with Minimum Number of Steiner Points

被引：0
|
作者：
DONGHUI CHEN
DING-ZHU DU
XIAO-DONG HU
GUO-HUI LIN
LUSHENG WANG
GUOLIANG XUE
机构：
[1] University of Minnesota,Department of Computer Science and Engineering
[2] City University of Hong Kong,Department of Computer Science
[3] Chinese Academy of Sciences,Institute of Applied Mathematics
[4] The University of Vermont,Department of Computer Science
来源：
Journal of Global Optimization | 2000年 / 18卷
关键词：
Steiner trees; Approximation algorithms; VLSI design; WDM optical networks;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Given n terminals in the Euclidean plane and a positive constant, find a Steiner tree interconnecting all terminals with the minimum number of Steiner points such that the Euclidean length of each edge is no more than the given positive constant. This problem is NP-hard with applications in VLSI design, WDM optical networks and wireless communications. In this paper, we show that (a) the Steiner ratio is 1/ 4, that is, the minimum spanning tree yields a polynomial-time approximation with performance ratio exactly 4, (b) there exists a polynomial-time approximation with performance ratio 3, and (c) there exists a polynomial-time approxi-mation scheme under certain conditions.
引用
收藏
页码：17 / 33
页数：16
相关论文
共 50 条
  • [31] Grade of service euclidean Steiner minimum trees
    Xue, GL
    Lin, GH
    Du, DZ
    ISCAS '99: PROCEEDINGS OF THE 1999 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOL 6: CIRCUITS ANALYSIS, DESIGN METHODS, AND APPLICATIONS, 1999, : 182 - 185
  • [32] On the minimum number of Steiner points of constrained 1-line-fixed Steiner tree in the Euclidean plane R2
    Li, Jianping
    Zheng, Yujie
    Lichen, Junran
    Wang, Wencheng
    OPTIMIZATION LETTERS, 2021, 15 (02) : 669 - 683
  • [33] Time delayed discounted Steiner trees to locate two or more discounted Steiner points
    Sirinanda, K. G.
    Brazil, M.
    Grossman, P. A.
    Rubinstein, J. H.
    Thomas, D. A.
    ANZIAM JOURNAL, 2015, 57 : C253 - C267
  • [34] ON THE NUMBER OF MINIMAL-1-STEINER TREES
    ARONOV, B
    BERN, M
    EPPSTEIN, D
    DISCRETE & COMPUTATIONAL GEOMETRY, 1994, 12 (01) : 29 - 34
  • [35] Isomorphic triangulations with small number of Steiner points
    Kranakis, E
    Urrutia, J
    INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 1999, 9 (02) : 171 - 180
  • [36] Grade of Service Steiner Minimum Trees in the Euclidean plane
    Xue, G
    Lin, GH
    Du, DZ
    ALGORITHMICA, 2001, 31 (04) : 479 - 500
  • [37] Approximating Minimum Steiner Point Trees in Minkowski Planes
    Brazil, M.
    Ras, C. J.
    Thomas, D. A.
    NETWORKS, 2010, 56 (04) : 244 - 254
  • [38] Integrality ratio for Group Steiner Trees and Directed Steiner Trees
    Halperin, E
    Kortsarz, G
    Krauthgamer, R
    Srinivasan, A
    Nan, W
    PROCEEDINGS OF THE FOURTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2003, : 275 - 284
  • [39] Simple distributed algorithms for approximating minimum Steiner trees
    Chalermsook, P
    Fakcharoenphol, J
    COMPUTING AND COMBINATORICS, PROCEEDINGS, 2005, 3595 : 380 - 389
  • [40] INTEGRALITY RATIO FOR GROUP STEINER TREES AND DIRECTED STEINER TREES
    Halperin, Eran
    Kortsarz, Guy
    Krauthgamer, Robert
    Srinivasan, Aravind
    Wang, Nan
    SIAM JOURNAL ON COMPUTING, 2007, 36 (05) : 1494 - 1511
12345