AN ALGORITHM FOR THE STEINER PROBLEM IN GRAPHS

[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]. JOURNAL OF THE ACM, 1972, 19 (04) : 699 - &

[4] CHRISTOFIDES N, 1975, GRAPH THEORY ALGORIT, P145

[5] ON EFFICIENCY OF ALGORITHM FOR STEINER MINIMAL TREES [J]. SIAM JOURNAL ON APPLIED MATHEMATICS, 1970, 18 (01) : 150 - &

[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

[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]. JOURNAL OF THE ACM, 1972, 19 (04) : 699 - &

[4] CHRISTOFIDES N, 1975, GRAPH THEORY ALGORIT, P145

[5] ON EFFICIENCY OF ALGORITHM FOR STEINER MINIMAL TREES [J]. SIAM JOURNAL ON APPLIED MATHEMATICS, 1970, 18 (01) : 150 - &

[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