STEINER TREE PROBLEMS

被引:311
作者
HWANG, FK [1 ]
RICHARDS, DS [1 ]
机构
[1] UNIV VIRGINIA, CHARLOTTESVILLE, VA 22903 USA
关键词
D O I
10.1002/net.3230220105
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
We give a survey up to 1989 on the Steiner tree problems which include the four important cases of euclidean, rectilinear, graphic, phylogenetic and some of their generalizations. We also provide a rather comprehensive and up-to-date bibliography which covers more than three hundred items.
引用
收藏
页码:55 / 89
页数:35
相关论文
共 310 条
[11]  
BALAKRISHNAN A, 1982, UNPUB FORMULATIONS A
[12]   ON THE CONVEX-HULL OF THE UNION OF CERTAIN POLYHEDRA [J].
BALAS, E .
OPERATIONS RESEARCH LETTERS, 1988, 7 (06) :279-283
[13]  
Beardwood J, 1959, P CAMBRIDGE PHILOS S, V55, P299, DOI [DOI 10.1017/S0305004100034095, 10.1017/S0305004100034095]
[14]   AN ALGORITHM FOR THE STEINER PROBLEM IN GRAPHS [J].
BEASLEY, JE .
NETWORKS, 1984, 14 (01) :147-159
[15]   AN SST-BASED ALGORITHM FOR THE STEINER PROBLEM IN GRAPHS [J].
BEASLEY, JE .
NETWORKS, 1989, 19 (01) :1-16
[16]  
BEASLEY JE, 1989, HEURISTIC EUCLIDEAN
[17]   THE STEINER PROBLEM WITH EDGE LENGTH-1 AND LENGTH-2 [J].
BERN, M ;
PLASSMANN, P .
INFORMATION PROCESSING LETTERS, 1989, 32 (04) :171-176
[18]   FASTER EXACT ALGORITHMS FOR STEINER TREES IN PLANAR NETWORKS [J].
BERN, M .
NETWORKS, 1990, 20 (01) :109-120
[19]  
BERN M, 1989, FURTHER POLYNOMIALLY
[20]  
Bern M. W., 1987, THESIS U CALIFORNIA