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 条

[41] On efficiency group multicasting algorithm with multiple minimum Steiner trees
Kim, Moonseong
Kang, Minseok
Choo, Hyunseung
Yang, Jong S.
Bang, Young-Cheol
COMPUTATIONAL SCIENCE - ICCS 2007, PT 3, PROCEEDINGS, 2007, 4489 : 432 - 439
[42] Construction of All Rectilinear Steiner Minimum Trees on the Hanan Grid
Lin, Sheng-En David
Kim, Dae Hyun
PROCEEDINGS OF THE 2018 INTERNATIONAL SYMPOSIUM ON PHYSICAL DESIGN (ISPD'18), 2018, : 18 - 25
[43] Steiner minimum trees for equidistant points on two sides of an angle
Burkard, Rainer E.
Dudas, Tibor
Acta Cybernetica, 1996, 12 (03): : 313 - 324
[44] Speeding up the Dreyfus–Wagner algorithm for minimum Steiner trees
Bernhard Fuchs
Walter Kern
Xinhui Wang
Mathematical Methods of Operations Research, 2007, 66 : 117 - 125
[45] HEURISTICS FOR THE MINIMUM RECTILINEAR STEINER TREE PROBLEM - NEW ALGORITHMS AND A COMPUTATIONAL STUDY
DESOUZA, CC
RIBEIRO, CC
DISCRETE APPLIED MATHEMATICS, 1993, 45 (03) : 205 - 220
[46] Approximating hexagonal Steiner minimal trees by fast optimal layout of minimum spanning trees
Univ of Vermont, Burlington, United States
Proc IEEE Int Conf Comput Des VLSI Comput Process, (392-398):
[47] Minimizing path lengths in rectilinear Steiner minimum trees with fixed topology
Kiefner, Annika Kristina
OPERATIONS RESEARCH LETTERS, 2016, 44 (06) : 835 - 838
[48] Speeding up the Dreyfus-Wagner algorithm for minimum Steiner trees
Fuchs, Bernhard
Kern, Walter
Wang, Xinhui
MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 2007, 66 (01) : 117 - 125
[49] On the Construction of Optimal Obstacle-Avoiding Rectilinear Steiner Minimum Trees
Huang, Tao
Li, Liang
Young, Evangeline F. Y.
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2011, 30 (05) : 718 - 731
[50] A group multicast routing algorithm by using multiple minimum Steiner trees
Jia, XH
Wang, LS
COMPUTER COMMUNICATIONS, 1997, 20 (09) : 750 - 758

← 1 2 3 4 5 →