STEINER TREE PROBLEMS

被引：311

作者：

HWANG, FK ^{[1
]}

RICHARDS, DS ^{[1
]}

机构：

[1] UNIV VIRGINIA, CHARLOTTESVILLE, VA 22903 USA

来源：

NETWORKS | 1992年 / 22卷 / 01期

关键词：

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 条

[1] ALGORITHMS FOR SPECIAL CASES OF RECTILINEAR STEINER TREES .1. POINTS ON THE BOUNDARY OF A RECTILINEAR RECTANGLE [J].

AGARWAL, PK ;

SHING, MT .

NETWORKS, 1990, 20 (04) :453-485

[2] RECTILINEAR STEINER TREES - EFFICIENT SPECIAL-CASE ALGORITHMS [J].

AHO, AV ;

GAREY, MR ;

HWANG, FK .

NETWORKS, 1977, 7 (01) :37-58

[3] AN INTEGER LINEAR-PROGRAMMING APPROACH TO THE STEINER PROBLEM IN GRAPHS [J].

ANEJA, YP .

NETWORKS, 1980, 10 (02) :167-178

[4]

[Anonymous], 1980, MATH JAPONICA

[5]

[Anonymous], [No title captured]

[6]

ARLINGHAUS SL, 1989, MONOGRAPH I MATH GEO, V9

[7]

ARNBORG S, 1988, LECT NOTES COMPUT SC, V317, P38

[8]

ARPIN D, 1983, PUBLICATION U MONTRE, V315

[9] CHORDALITY PROPERTIES ON GRAPHS AND MINIMAL CONCEPTUAL CONNECTIONS IN SEMANTIC DATA MODELS [J].

AUSIELLO, G ;

DATRI, A ;

MOSCARINI, M .

JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1986, 33 (02) :179-202

[10] PROBLEM REDUCTION METHODS AND A TREE GENERATION ALGORITHM FOR THE STEINER NETWORK PROBLEM [J].

BALAKRISHNAN, A ;

PATEL, NR .

NETWORKS, 1987, 17 (01) :65-85

← 1 2 3 4 5 6 7 8 9 10 →