AN ALGORITHM FOR THE STEINER PROBLEM IN THE EUCLIDEAN PLANE

被引：48

作者：

WINTER, P ^{[1
]}

机构：

[1] UNIV COPENHAGEN,INST DATAL,DIKU,DK-2200 COPENHAGEN N,DENMARK

来源：

NETWORKS | 1985年 / 15卷 / 03期

关键词：

D O I：

10.1002/net.3230150305

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：323 / 345

页数：23

共 17 条

[1]

Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st

[2]

Boyce W. M., 1977, ACM Transactions on Mathematical Software, V3, P359, DOI 10.1145/355759.355764

[3]

BOYCE WM, 35 BELL LAB COMP SCI

[4] ON EFFICIENCY OF ALGORITHM FOR STEINER MINIMAL TREES [J].

COCKAYNE, EJ .

SIAM JOURNAL ON APPLIED MATHEMATICS, 1970, 18 (01) :150-&

[5]

COCKAYNE EJ, 1972, COMBINATORICA, P52

[6]

Courant R., 1941, WHAT IS MATH

[7]

Coxeter H. S. M., 1961, INTRO GEOMETRY

[8] A SHORT PROOF OF A RESULT OF POLLAK ON STEINER MINIMAL-TREES [J].

DU, DZ ;

YAO, EY ;

HWANG, FK .

JOURNAL OF COMBINATORIAL THEORY SERIES A, 1982, 32 (03) :396-400

[9] COMPLEXITY OF COMPUTING STEINER MINIMAL TREES [J].

GAREY, MR ;

GRAHAM, RL ;

JOHNSON, DS .

SIAM JOURNAL ON APPLIED MATHEMATICS, 1977, 32 (04) :835-859

[10] STEINER MINIMAL TREES [J].

GILBERT, EN ;

POLLAK, HO .

SIAM JOURNAL ON APPLIED MATHEMATICS, 1968, 16 (01) :1-&

← 1 2 →