Funder
Project for Innovation Team (Cultivation) of Yunnan Province
National Natural Science Foundation of China
Fundamental Research Funds for the Central Universities
Project of Yunling Scholars Training of Yunnan Province
Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research
Reference24 articles.
1. 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)
2. Arora, S.: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. J. ACM 45(5), 753–782 (1998)
3. Hwang, F.K., Richards, D.S.: Steiner tree problem. Networks 22(1), 55–89 (1992)
4. Williamson, D.P., Shmoys, D.B.: The Design of Approximation Algorithms. Cambridge University Press, New York (2010)
5. Wang, L.S., Li, Z.M.: An approximation algorithm for a bottleneck $$k$$-Steiner tree problem in the Euclidean plane. Inform. Process. Lett. 81(3), 151–156 (2002)