GENERATION OF MINIMAL TREES WITH A STEINER TOPOLOGY

被引：36

作者：

CHANG, SK

机构：

来源：

关键词：

D O I：

10.1145/321724.321733

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：699 / &

共 13 条

[1]

CHANG SK, 1972, P PIB S COMPUTER COM, V22

[2] ON STEINER PROBLEM [J].

COCKAYNE, EJ .

CANADIAN MATHEMATICAL BULLETIN, 1967, 10 (03) :431-&

[3] STEINERS PROBLEM FOR SET-TERMINALS [J].

COCKAYNE, EJ ;

MELZAK, ZA .

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

COCKAYNE, EJ .

[5]

COCKAYNE EJ, 1969, MATH COMP, V23, P107

[6]

Courant R., 1941, WHAT IS MATH, P354

[7]

COXETER HSM, 1961, INTRO GEOMETRY, P21

[8] STEINER MINIMAL TREES [J].

GILBERT, EN ;

POLLAK, HO .

[9] MINIMUM COST COMMUNICATION NETWORKS [J].

GILBERT, EN .

BELL SYSTEM TECHNICAL JOURNAL, 1967, 46 (09) :2209-+

[10] ON STEINERS PROBLEM WITH RECTILINEAR DISTANCE [J].

HANAN, M .