ON FINDING RECTILINEAR STEINER MINIMAL-TREES

被引：0

作者：

BASART, JM

RIFA, J

机构：

来源：

REVISTA DE INFORMATICA Y AUTOMATICA | 1989年 / 22卷 / 02期

关键词：

D O I：

暂无

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

引用

页码：40 / 45

页数：6

共 11 条

[1] GENERATION OF MINIMAL TREES WITH A STEINER TOPOLOGY [J].

CHANG, SK .

JOURNAL OF THE ACM, 1972, 19 (04) :699-&

[2]

FARLEY AM, 1980, J SIAM, V1, P70

[3]

Garey M., 1977, J APPL MATH, V32, P826

[4]

GILBERT EN, 1968, J SOC INDUSTRIAL APP, V16, P1

[5] O(N LOG N) ALGORITHM FOR RECTILINEAR MINIMAL SPANNING TREES [J].

HWANG, FK .

JOURNAL OF THE ACM, 1979, 26 (02) :177-182

[6]

HWANG FK, 1976, J SIAM, V30, P104

[7] USE OF STEINERS PROBLEM IN SUBOPTIMAL ROUTING IN RECTILINEAR METRIC [J].

LEE, JH ;

BOSE, NK ;

HWANG, FK .

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS, 1976, 23 (07) :470-476

[8]

PROVAN JS, 1988, NETWORKS, V18, P55, DOI 10.1002/net.3230180108

[9] AN 0 (N LOG N) HEURISTIC ALGORITHM FOR THE RECTILINEAR STEINER MINIMAL TREE PROBLEM [J].

SMITH, JM ;

LEE, DT ;

LIEBMAN, JS .

ENGINEERING OPTIMIZATION, 1980, 4 (04) :179-192

[10] STEINER PROBLEM IN NETWORKS - A SURVEY [J].

WINTER, P .

NETWORKS, 1987, 17 (02) :129-167

← 1 2 →