Author:
Lichen Junran,Li Jianping,Wang Wencheng,Yeh Jean,Yeh YeongNan,Yu Xingxing,Zheng Yujie
Publisher
Springer International Publishing
Reference19 articles.
1. Berg, M.d., Cheong, O., Kreveld, Mv., Overmars, M.: Computational Geometry: Algorithms and Applications. Springer, New York (2008)
2. Bern, M., Plassmann, P.: The Steiner problem with edge lengths 1 and 2. Inf. Process. Lett. 32(4), 171–176 (1989)
3. Cheng, X.Z., Du, D.Z.: Steiner Trees in Industry. Combinatorial Optimization 11. Kluwer Academic Publishers, Dordrecht, The Netherlands (2001)
4. Garey, M.R., Graham, R.L., Johnson, D.S.: The complexity of computing Steiner minimal trees. SIAM J. Appl. Math. 32(4), 835–859 (1977)
5. Garey, M.R., Johnson, D.S.: The rectilinear Steiner tree problem is NP-complete. SIAM J. Appl. Math. 32(4), 826–834 (1977)