ON GREEDY HEURISTICS FOR STEINER MINIMUM TREES

被引：0
|
作者：
DU, DZ [1 ]
机构：
[1] CHINESE ACAD SCI,INST APPL MATH,BEIJING 100080,PEOPLES R CHINA
来源：
ALGORITHMICA | 1995年 / 13卷 / 04期
关键词：
STEINER TREES; GREED HEURISTIC;
D O I：
10.1007/BF01293486
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
We disprove a conjecture of Shor and Smith on a greedy heuristic for the Steiner minimum tree by showing that the length ratio between the Steiner minimum tree and the greedy tree constructed by their method for the same set of points can be arbitrarily close to root 3/2. We also propose a new conjecture.
引用
收藏
页码：381 / 386
页数：6
相关论文
共 50 条
  • [31] Approximating Minimum Steiner Point Trees in Minkowski Planes
    Brazil, M.
    Ras, C. J.
    Thomas, D. A.
    NETWORKS, 2010, 56 (04) : 244 - 254
  • [32] Simple distributed algorithms for approximating minimum Steiner trees
    Chalermsook, P
    Fakcharoenphol, J
    COMPUTING AND COMBINATORICS, PROCEEDINGS, 2005, 3595 : 380 - 389
  • [33] Grade of Service Steiner Minimum Trees in the Euclidean Plane
    Algorithmica, 2001, 31 : 479 - 500
  • [34] Minimum diameter cost-constrained Steiner trees
    Wei Ding
    Guoliang Xue
    Journal of Combinatorial Optimization, 2014, 27 : 32 - 48
  • [35] Minimum diameter cost-constrained Steiner trees
    Ding, Wei
    Xue, Guoliang
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2014, 27 (01) : 32 - 48
  • [36] Euclidean Steiner minimum trees: An improved exact algorithm
    Winter, P
    Zachariasen, M
    NETWORKS, 1997, 30 (03) : 149 - 166
  • [37] Two special cases for rectilinear Steiner minimum trees
    Du, DZ
    Shragowitz, E
    Wan, PJ
    NETWORK OPTIMIZATION, 1997, 450 : 221 - 233
  • [38] Greedy heuristics for the diameter-constrained minimum spanning tree problem
    Requejo C.
    Santos E.
    Journal of Mathematical Sciences, 2009, 161 (6) : 930 - 943
  • [39] Trees of Shortest Paths vs. Steiner Trees: Understanding and Improving Delete Relaxation Heuristics
    Keyder, Emil
    Geffner, Hector
    21ST INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-09), PROCEEDINGS, 2009, : 1734 - 1739
  • [40] Balancing Steiner minimum trees and shortest-path trees in the rectilinear plane
    Lin, GH
    Xue, GL
    ISCAS '99: PROCEEDINGS OF THE 1999 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOL 6: CIRCUITS ANALYSIS, DESIGN METHODS, AND APPLICATIONS, 1999, : 117 - 120
12345