{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T01:49:29Z","timestamp":1743040169278,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319213972"},{"type":"electronic","value":"9783319213989"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21398-9_24","type":"book-chapter","created":{"date-parts":[[2015,6,23]],"date-time":"2015-06-23T15:12:41Z","timestamp":1435072361000},"page":"297-309","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Computing Minimum Dilation Spanning Trees in Geometric Graphs"],"prefix":"10.1007","author":[{"given":"Al\u00e9x F.","family":"Brandt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miguel F. A.","family":"de Gaiowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pedro J.","family":"de Rezende","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cid C.","family":"de Souza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,24]]},"reference":[{"key":"24_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546884","volume-title":"Geometric Spanner Networks","author":"G Narasimhan","year":"2007","unstructured":"Narasimhan, G., Smid, M.: Geometric Spanner Networks. Cambridge University Press, New York (2007)"},{"issue":"1","key":"24_CR2","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1002\/jgt.3190130114","volume":"13","author":"D Peleg","year":"1989","unstructured":"Peleg, D., Sch\u00e4fer, A.A.: Graph spanners. Journal of Graph Theory 13(1), 99\u2013116 (1989)","journal-title":"Journal of Graph Theory"},{"issue":"3","key":"24_CR3","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.comgeo.2007.12.001","volume":"41","author":"O Cheong","year":"2008","unstructured":"Cheong, O., Haverkort, H., Lee, M.: Computing a minimum-dilation spanning tree is NP-hard. Comput. Geom. Theory Appl. 41(3), 188\u2013205 (2008)","journal-title":"Comput. Geom. Theory Appl."},{"issue":"3","key":"24_CR4","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/j.comgeo.2007.07.004","volume":"40","author":"B Aronov","year":"2008","unstructured":"Aronov, B., de Berg, M., Cheong, O., Gudmundsson, J., Haverkort, H., Smid, M., Vigneron, A.: Sparse geometric graphs with small dilation. Computational Geometry 40(3), 207\u2013219 (2008)","journal-title":"Computational Geometry"},{"key":"24_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1007\/978-3-540-30140-0_70","volume-title":"Algorithms \u2013 ESA 2004","author":"M Sigurd","year":"2004","unstructured":"Sigurd, M., Zachariasen, M.: Construction of minimum-weight spanners. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol. 3221, pp. 797\u2013808. Springer, Heidelberg (2004)"},{"key":"24_CR6","doi-asserted-by":"publisher","first-page":"3:1.3","DOI":"10.1145\/1498698.1564499","volume":"14","author":"M Farshi","year":"2009","unstructured":"Farshi, M., Gudmundsson, J.: Experimental study of geometric $$t$$-spanners. J. Exp. Algorithmics 14, 3:1.3\u20133:1.39 (2009)","journal-title":"J. Exp. Algorithmics"},{"key":"24_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/978-3-540-70904-6_20","volume-title":"Graph Drawing","author":"R Klein","year":"2007","unstructured":"Klein, R., Kutz, M.: Computing geometric minimum-dilation graphs Is NP-hard. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol. 4372, pp. 196\u2013207. Springer, Heidelberg (2007)"},{"key":"24_CR8","unstructured":"Magnanti, T.: Wolsey: Optimal trees. CORE discussion paper. Center for Operations Research and Econometrics (1994)"},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"Resende, M.G.C., Ribeiro, C.C.: Greedy randomized adaptive search procedures: advances, hybridizations, and applications. In: Glover, F., Kochenberger, G.A. (eds.) Handbook of Metaheuristics, vol. 57. International Series in Operations Research and Management Science. second edn., pp. 219\u2013249. Springer (2009)","DOI":"10.1007\/0-306-48056-5_8"},{"issue":"6","key":"24_CR10","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"RC Prim","year":"1957","unstructured":"Prim, R.C.: Shortest connection networks and some generalizations. The Bell Systems Technical Journal 36(6), 1389\u20131401 (1957)","journal-title":"The Bell Systems Technical Journal"},{"key":"24_CR11","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1016\/j.cor.2008.05.011","volume":"37","author":"CC Ribeiro","year":"2010","unstructured":"Ribeiro, C.C., Resende, M.G.C.: Path-relinking intensification methods for stochastic local search algorithms. Computers and Operations Research 37, 498\u2013508 (2010)","journal-title":"Computers and Operations Research"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21398-9_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,20]],"date-time":"2023-01-20T15:32:38Z","timestamp":1674228758000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21398-9_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319213972","9783319213989"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21398-9_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"24 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}