共 42 条
- [1] Kruskal J.B., On the shortest spanning subtree of a graph and traveling salesman problem, Proc. Amer. Math. Soc., 7, pp. 48-50, (1956)
- [2] Prim R.C., Shortest connecting networks and some generalizations, BSTJ, 36, pp. 1389-1401, (1957)
- [3] Dijkstra E.W., A note on two problems with connection with graphs, Numer. Math., 1, 5, pp. 269-271, (1959)
- [4] Melzak Z.A., On the problem of Steiner, Canad. Math. Bull., 4, pp. 143-148, (1960)
- [5] Gilbert E.N., Pollak H.O., Steiner minimal trees, SIAM J. Appl. Math., 16, 1, pp. 1-29, (1968)
- [6] Du D.Z., Hwang F.K., A New Bound for the Steiner Ratio, Trans. Amer. Math. Soc., 278, 1, pp. 137-148, (1983)
- [7] Du D.Z., Hwang F.K., Weng J.F., Steiner minimal trees for points on a zig-zag lines, Trans. Amer. Math. Soc., 278, 1, pp. 149-156, (1983)
- [8] Du D.Z., Hwang F.K., Chao S.C., Steiner minimal trees for points on a circle, Proc. Amer. Math. Soc., 95, 4, pp. 613-618, (1985)
- [9] Du D.Z., Hwang F.K., Yao E.N., The Steiner ratio conjecture is true for five points, J. Combin Thy., Ser., A38, pp. 230-240, (1985)
- [10] Hwang F.K., A linear time algorithm for full Steiner trees, Oper. Res. Letter, 5, pp. 235-237, (1986)