A NEW BOUND FOR EUCLIDEAN STEINER MINIMAL TREES
暂无分享,去创建一个
[1] H. Pollak,et al. Steiner Minimal Trees , 1968 .
[2] Henry O. Pollak,et al. Some Remarks on the Steiner Problem , 1978, J. Comb. Theory A.
[3] F. Hwang. On Steiner Minimal Trees with Rectilinear Distance , 1976 .
[4] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[5] David S. Johnson,et al. The Complexity of Computing Steiner Minimal Trees , 1977 .
[6] Robert R. Kallman,et al. A Conjecture of Gilbert and Pollak on Minimal Trees , 1973 .
[7] F. K. Hwang,et al. The Steiner Ratio Conjecture Is True for Five Points , 1985, J. Comb. Theory A.
[8] Fan Chung,et al. A Lower Bound for the Steiner Tree Problem , 1978 .
[9] Ding-Zhu Du,et al. A new bound for the steiner ratio , 1983 .