A FAST ALGORITHM FOR STEINER TREES

[1] Cheriton D., 1976, SIAM Journal on Computing, V5, P724, DOI 10.1137/0205051

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

[3] ALGORITHM-97 - SHORTEST PATH [J]. COMMUNICATIONS OF THE ACM, 1962, 5 (06) : 345 - 345

[4] GAREY MR, 1976, 8TH P ANN ACM S THEO, P10

[5] STEINER MINIMAL TREES [J]. SIAM JOURNAL ON APPLIED MATHEMATICS, 1968, 16 (01) : 1 - &

[6] STEINER MINIMAL TREES WITH RECTILINEAR DISTANCE [J]. SIAM JOURNAL ON APPLIED MATHEMATICS, 1976, 30 (01) : 104 - 115

[7] Karp R.M., 1972, COMPLEXITY COMPUTER

[8] Yao A. C., 1975, Information Processing Letters, V4, P21, DOI 10.1016/0020-0190(75)90056-3

[9] [No title captured]

[1] Cheriton D., 1976, SIAM Journal on Computing, V5, P724, DOI 10.1137/0205051

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

[3] ALGORITHM-97 - SHORTEST PATH [J]. COMMUNICATIONS OF THE ACM, 1962, 5 (06) : 345 - 345

[4] GAREY MR, 1976, 8TH P ANN ACM S THEO, P10

[5] STEINER MINIMAL TREES [J]. SIAM JOURNAL ON APPLIED MATHEMATICS, 1968, 16 (01) : 1 - &

[6] STEINER MINIMAL TREES WITH RECTILINEAR DISTANCE [J]. SIAM JOURNAL ON APPLIED MATHEMATICS, 1976, 30 (01) : 104 - 115

[7] Karp R.M., 1972, COMPLEXITY COMPUTER

[8] Yao A. C., 1975, Information Processing Letters, V4, P21, DOI 10.1016/0020-0190(75)90056-3

[9] [No title captured]