AN ALGORITHM FOR THE STEINER PROBLEM IN GRAPHS

被引：31

作者：

SHORE, ML

FOULDS, LR

GIBBONS, PB

机构：

来源：

关键词：

D O I：

10.1002/net.3230120309

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：323 / 333

页数：11

共 18 条

[1]

[Anonymous], 1956, NETWORK FLOW THEORY

[2]

BELLMAN R, 1962, QUART APPL MATH, V16, P349

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

CHANG, SK .

[4]

CHRISTOFIDES N, 1975, GRAPH THEORY ALGORIT, P145

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

COCKAYNE, EJ .

[6]

Dijkstra EW., 1959, NUMER MATH, V1, P269, DOI DOI 10.1007/BF01386390

[7]

Dreyfus SE, 1971, NETWORKS, V1, P195

[8]

FLOYD RW, 1958, COMM ACM, V16, P87

[9]

FOULDS LR, 1978, NEW ZEAL OPER RES, V6, P21

[10]

FOULDS LR, 1978, 14TH ANN C ORSNZ CHR