{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T04:00:27Z","timestamp":1742961627340,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319388502"},{"type":"electronic","value":"9783319388519"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-38851-9_15","type":"book-chapter","created":{"date-parts":[[2016,5,31]],"date-time":"2016-05-31T15:33:54Z","timestamp":1464708834000},"page":"217-230","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Steiner Tree Heuristic in the Euclidean d-Space Using Bottleneck Distances"],"prefix":"10.1007","author":[{"given":"Stephan S.","family":"Lorenzen","sequence":"first","affiliation":[]},{"given":"Pawel","family":"Winter","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,6,1]]},"reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/BF02187906","volume":"3","author":"C Bajaj","year":"1988","unstructured":"Bajaj, C.: The algebraic degree of geometric optimization problems. Discrete Comput. Geom. 3, 177\u2013191 (1988)","journal-title":"Discrete Comput. Geom."},{"issue":"4","key":"15_CR2","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1002\/net.3230240404","volume":"24","author":"JE Beasley","year":"1994","unstructured":"Beasley, J.E., Goffinet, F.: A Delaunay triangulation-based heuristic for the Euclidean Steiner problem. Networks 24(4), 215\u2013224 (1994)","journal-title":"Networks"},{"key":"15_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational Geometry - Algorithms and Applications","author":"M Berg de","year":"2008","unstructured":"de Berg, M., Cheong, O., van Krevald, M., Overmars, M.: Computational Geometry - Algorithms and Applications, 3rd edn. Springer, Heidelberg (2008)","edition":"3"},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s00407-013-0127-z","volume":"68","author":"M Brazil","year":"2014","unstructured":"Brazil, M., Graham, R.L., Thomas, D.A., Zachariasen, M.: On the history of the Euclidean Steiner tree problem. Arch. Hist. Exact Sci. 68, 327\u2013354 (2014)","journal-title":"Arch. Hist. Exact Sci."},{"key":"15_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-13915-9","volume-title":"Optimal Interconnection Trees in the Plane","author":"M Brazil","year":"2015","unstructured":"Brazil, M., Zachariasen, M.: Optimal Interconnection Trees in the Plane. Springer, Cham (2015)"},{"key":"15_CR6","unstructured":"DIMACS, ICERM: 11th DIMACS Implementation Challenge: Steiner Tree Problems (2014). http:\/\/dimacs11.cs.princeton.edu\/"},{"key":"15_CR7","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1016\/j.disopt.2007.08.006","volume":"5","author":"M Fampa","year":"2008","unstructured":"Fampa, M., Anstreicher, K.M.: An improved algorithm for computing Steiner minimal trees in Euclidean d-space. Discrete Optim. 5, 530\u2013540 (2008)","journal-title":"Discrete Optim."},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Fampa, M., Lee, J., Maculan, N.: An overview of exact algorithms for the Euclidean Steiner tree problem in n-space, Int. Trans. OR (2015)","DOI":"10.1111\/itor.12207"},{"key":"15_CR9","unstructured":"Fonseca, R., Brazil, M., Winter, P., Zachariasen, M.: Faster exact algorithms for computing Steiner trees in higher dimensional Euclidean spaces. In: Proceedings of the 11th DIMACS Implementation Challenge, Providence, Rhode Island, USA (2014). http:\/\/dimacs11.cs.princeton.edu\/workshop.html"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"do Forte, V.L., Montenegro, F.M.T., de Moura Brito, J.A., Maculan, N.: Iterated local search algorithms for the Euclidean Steiner tree problem in $$n$$ n dimensions. Int. Trans. OR (2015)","DOI":"10.1111\/itor.12168"},{"issue":"1","key":"15_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/0116001","volume":"16","author":"EN Gilbert","year":"1968","unstructured":"Gilbert, E.N., Pollak, H.O.: Steiner minimal trees. SIAM J. Appl. Math. 16(1), 1\u201329 (1968)","journal-title":"SIAM J. Appl. Math."},{"key":"15_CR12","volume-title":"The Steiner Tree Problem","author":"FK Hwang","year":"1992","unstructured":"Hwang, F.K., Richards, D.S., Winter, P.: The Steiner Tree Problem. North-Holland, Amsterdam (1992)"},{"key":"15_CR13","unstructured":"Juhl, D., Warme, D.M., Winter, P., Zachariasen, M.: The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study. In: Proceedings of the 11th DIMACS Implementation Challenge, Providence, Rhode Island, USA (2014). http:\/\/dimacs11.cs.princeton.edu\/workshop.html"},{"issue":"5","key":"15_CR14","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1016\/j.comgeo.2011.11.007","volume":"46","author":"JWV Laarhoven","year":"2013","unstructured":"Laarhoven, J.W.V., Anstreicher, K.M.: Geometric conditions for Euclidean Steiner trees in $${R}^d$$ R d . Comput. Geom. Theor. Appl. 46(5), 520\u2013531 (2013)","journal-title":"Comput. Geom. Theor. Appl."},{"issue":"4","key":"15_CR15","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s10732-010-9137-z","volume":"17","author":"JWV Laarhoven","year":"2011","unstructured":"Laarhoven, J.W.V., Ohlmann, J.W.: A randomized Delaunay triangulation heuristic for the Euclidean Steiner tree problem in $${R}^d$$ R d . J. Heuristics 17(4), 353\u2013372 (2011)","journal-title":"J. Heuristics"},{"key":"15_CR16","unstructured":"Lorenzen, S.S., Winter, P.: Code and Data Repository at Github (2016). https:\/\/github.com\/StephanLorenzen\/ESMT-heuristic-using-bottleneck-distances\/blob\/master\/README.md"},{"key":"15_CR17","unstructured":"Olsen, A., Lorenzen, S. Fonseca, R., Winter, P.: Steiner tree heuristics in Euclidean $$d$$ d -space. In: Proceedings of the 11th DIMACS Implementation Challenge, Providence, Rhode Island, USA (2014). http:\/\/dimacs11.cs.princeton.edu\/workshop.html"},{"key":"15_CR18","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0925-7721(95)00013-Y","volume":"5","author":"R Seidel","year":"1995","unstructured":"Seidel, R.: The upper bound theorem for polytopes: an easy proof of its asymptotic version. Comp. Geom.-Theor. Appl. 5, 115\u2013116 (1995)","journal-title":"Comp. Geom.-Theor. Appl."},{"issue":"3","key":"15_CR19","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1016\/0022-0000(83)90006-5","volume":"26","author":"DD Sleator","year":"1983","unstructured":"Sleator, D.D., Tarjan, R.E.: A data structure for dynamic trees. J. Comput. Syst. Sci. 26(3), 362\u2013391 (1983)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"15_CR20","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1002\/net.3230110104","volume":"11","author":"JM Smith","year":"1981","unstructured":"Smith, J.M., Lee, D.T., Liebman, J.S.: An O( $$n \\log n$$ n log n ) heuristic for Steiner minimal tree problems on the Euclidean metric. Networks 11(1), 23\u201339 (1981)","journal-title":"Networks"},{"key":"15_CR21","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/BF01758756","volume":"7","author":"WD Smith","year":"1992","unstructured":"Smith, W.D.: How to find Steiner minimal trees in Euclidean d-space. Algorithmica 7, 137\u2013177 (1992)","journal-title":"Algorithmica"},{"key":"15_CR22","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s10852-004-6390-x","volume":"4","author":"B Toppur","year":"2005","unstructured":"Toppur, B., Smith, J.M.: A sausage heuristic for Steiner minimal trees in three-dimensional Euclidean space. J. Math. Model. Algorithms 4, 199\u2013217 (2005)","journal-title":"J. Math. Model. Algorithms"},{"key":"15_CR23","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-1-4757-3171-2_6","volume-title":"Advances in Steiner Trees","author":"DM Warme","year":"2000","unstructured":"Warme, D.M., Winter, P., Zachariasen, M.: Exact algorithms for plane Steiner tree problems: a computational study. In: Du, D.-Z., Smith, J., Rubinstein, J. (eds.) Advances in Steiner Trees, pp. 81\u2013116. Springer, Dordrecht (2000)"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-38851-9_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,21]],"date-time":"2020-09-21T10:42:53Z","timestamp":1600684973000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-38851-9_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319388502","9783319388519"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-38851-9_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"1 June 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}