{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T04:40:03Z","timestamp":1744000803930,"version":"3.40.3"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","license":[{"start":{"date-parts":[[2012,8,24]],"date-time":"2012-08-24T00:00:00Z","timestamp":1345766400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"DOI":"10.1007\/s10898-012-9967-3","type":"journal-article","created":{"date-parts":[[2012,8,23]],"date-time":"2012-08-23T09:32:33Z","timestamp":1345714353000},"source":"Crossref","is-referenced-by-count":0,"title":["Approximations for two variants of the Steiner tree problem in the Euclidean plane $${\\mathbb{R}^2}$$"],"prefix":"10.1007","author":[{"given":"Jianping","family":"Li","sequence":"first","affiliation":[]},{"given":"Haiyan","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Binchao","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Junran","family":"Lichen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,8,24]]},"reference":[{"key":"9967_CR1","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1023\/A:1008384012064","volume":"18","author":"D.H. Chen","year":"2000","unstructured":"Chen D.H., Du D.Z., Hu X.D., Lin G.H., Wang L.S., Xue G.L.: Approximations for Steiner trees with minimum number of Steiner points. J. Glob. Optim. 18, 17\u201333 (2000)","journal-title":"J. Glob. Optim."},{"doi-asserted-by":"crossref","unstructured":"Chiang, C., Sarrafzadeh, M., Wong, C.K.: A powerful global router: Based on Steiner min-max trees. 1989 IEEE International Conference on Computer-Aided Design, IEEE, 2\u20135 (1989)","key":"9967_CR2","DOI":"10.1109\/ICCAD.1989.76892"},{"key":"9967_CR3","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1111\/j.1749-6632.1985.tb14564.x","volume":"440","author":"F.R.K. Chung","year":"1985","unstructured":"Chung F.R.K., Graham R.L.: A new bound for the Euclidean Steiner minimal trees. Ann. N.Y. Acad. Sci. 440, 328\u2013346 (1985)","journal-title":"Ann. N.Y. Acad. Sci."},{"unstructured":"Coffman, E.G., Garey, M.R., Johnson, D.S.: Approximation algorithms for bin packing: a survey. In: Hochbaum, D.(ed.) Approximation Algorithms for NP-Hard Problems, pp. 46\u201393 PWS Publishing, Boston (1996)","key":"9967_CR4"},{"key":"9967_CR5","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF01758755","volume":"7","author":"D.Z. Du","year":"1992","unstructured":"Du D.Z., Hwang F.K.: A proof of Gilbert-Pollak\u2019s conjecture on the Steiner ratio. Algorithmica 7, 121\u2013135 (1992)","journal-title":"Algorithmica"},{"key":"9967_CR6","doi-asserted-by":"crossref","first-page":"835","DOI":"10.1137\/0132072","volume":"32","author":"M.R. Garey","year":"1977","unstructured":"Garey M.R., Graham R.L., Johnson D.S.: The complexity of computing Steiner minimal trees. SIAM J. Appl. Math. 32, 835\u2013859 (1977)","journal-title":"SIAM J. Appl. Math."},{"key":"9967_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey M.R., Johnson D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, San Francisco (1979)"},{"key":"9967_CR8","doi-asserted-by":"crossref","first-page":"2209","DOI":"10.1002\/j.1538-7305.1967.tb04250.x","volume":"9","author":"E.N. Gilbert","year":"1967","unstructured":"Gilbert E.N.: Minimum cost communication networks. Bell. Syst. Tech. J. 9, 2209\u20132227 (1967)","journal-title":"Bell. Syst. Tech. J."},{"key":"9967_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0116001","volume":"16","author":"E.N. Gilbert","year":"1968","unstructured":"Gilbert E.N., Pollak H.O.: Steiner minimal trees. SIAM J. Appl. Math. 16, 1\u201329 (1968)","journal-title":"SIAM J. Appl. Math."},{"key":"9967_CR10","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1002\/net.3230220105","volume":"22","author":"F.K. Hwang","year":"1992","unstructured":"Hwang F.K., Richard D.: Steiner tree problems. Networks 22, 55\u201389 (1992)","journal-title":"Networks"},{"key":"9967_CR11","volume-title":"The Steiner Minimum Tree Problems","author":"F.K. Hwang","year":"1992","unstructured":"Hwang F.K., Richard D., Winter P.: The Steiner Minimum Tree Problems. Annals of Discrete Mathematics 53, North-Holland (1992)"},{"issue":"1\u20132","key":"9967_CR12","doi-asserted-by":"crossref","first-page":"630","DOI":"10.1007\/s00453-011-9508-3","volume":"62","author":"A.O. Ivanov","year":"2012","unstructured":"Ivanov A.O., Tuzhilin A.A.: The Steiner ratio Gilbert-Pollak conjecture is still open (Clarification Statement). Algorithmica 62(1\u20132), 630\u2013632 (2012)","journal-title":"Algorithmica"},{"doi-asserted-by":"crossref","unstructured":"Li, C.S., Tong, F.F.K., Georgiou, C.J., Chen, M.: Gain equalization in metropolitan and wide area optical networks using optical amplifiers. In: Proceedings of IEEE INFOCOM\u201994, 130\u2013137 (1994)","key":"9967_CR13","DOI":"10.1109\/INFCOM.1994.337624"},{"key":"9967_CR14","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/S0020-0190(98)00201-4","volume":"69","author":"G.H. Lin","year":"1999","unstructured":"Lin G.H., Xue G.L.: Steiner tree problem with minimum number of Steiner points and bounded edge-length. Inf. Process. Lett. 69, 53\u201357 (1999)","journal-title":"Inf. Process. Lett."},{"key":"9967_CR15","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"C.H. Papadimitriou","year":"1998","unstructured":"Papadimitriou C.H., Steiglitz K.: Combinatorial Optimization: Algorithms and Complexity. Dover Publications Inc., New York (1998)"},{"doi-asserted-by":"crossref","unstructured":"Ramamurthy, B., Iness, J., Mukherjee, B.: Minimizing the number of optical amplifiers needed to support a multi-wavelength optical LAN\/MAN. In: Proceedings of IEEE INFO-COM\u201997, 261\u2013268 (1997)","key":"9967_CR16","DOI":"10.1109\/INFCOM.1997.635138"},{"key":"9967_CR17","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"A. Schrijver","year":"2003","unstructured":"Schrijver A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, The Netherlands (2003)"},{"issue":"4","key":"9967_CR18","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1002\/1520-6750(199406)41:4<579::AID-NAV3220410409>3.0.CO;2-G","volume":"41","author":"D. Simchi-Levi","year":"1994","unstructured":"Simchi-Levi D.: New worst-case results for the bin-packing problem. Nav. Res. Logist. 41(4), 579\u2013585 (1994)","journal-title":"Nav. Res. Logist."},{"key":"9967_CR19","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1137\/0129048","volume":"29","author":"J. Soukup","year":"1975","unstructured":"Soukup J.: On minimum cost networks with nonlinear costs. SIAM J. Appl. Math. 29, 571\u2013581 (1975)","journal-title":"SIAM J. Appl. Math."},{"key":"9967_CR20","volume-title":"Approximation Algorithms","author":"V.V. Vazirani","year":"2001","unstructured":"Vazirani V.V.: Approximation Algorithms. Springer, Berlin (2001)"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-012-9967-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-012-9967-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-012-9967-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T04:05:32Z","timestamp":1743998732000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-012-9967-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8,24]]},"references-count":20,"alternative-id":["9967"],"URL":"https:\/\/doi.org\/10.1007\/s10898-012-9967-3","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2012,8,24]]}}}