{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:34:48Z","timestamp":1725744888265},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642404498"},{"type":"electronic","value":"9783642404504"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40450-4_4","type":"book-chapter","created":{"date-parts":[[2013,8,15]],"date-time":"2013-08-15T23:22:47Z","timestamp":1376608967000},"page":"37-48","source":"Crossref","is-referenced-by-count":3,"title":["Computing the Greedy Spanner in Linear Space"],"prefix":"10.1007","author":[{"given":"Sander P. A.","family":"Alewijnse","sequence":"first","affiliation":[]},{"given":"Quirijn W.","family":"Bouts","sequence":"additional","affiliation":[]},{"given":"Alex P.","family":"ten Brink","sequence":"additional","affiliation":[]},{"given":"Kevin","family":"Buchin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Alewijnse, S.P.A., Bouts, Q.W., ten Brink, A.P., Buchin, K.: Computing the greedy spanner in linear space. CoRR, arXiv:1306.4919 (2013)","DOI":"10.1007\/978-3-642-40450-4_4"},{"issue":"3","key":"4_CR2","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1007\/s00453-009-9293-4","volume":"58","author":"P. Bose","year":"2010","unstructured":"Bose, P., Carmi, P., Farshi, M., Maheshwari, A., Smid, M.: Computing the greedy spanner in near-quadratic time. Algorithmica\u00a058(3), 711\u2013729 (2010)","journal-title":"Algorithmica"},{"key":"4_CR3","unstructured":"Callahan, P.B.: Dealing with Higher Dimensions: The Well-Separated Pair Decomposition and Its Applications. PhD thesis, Johns Hopkins University, Baltimore, Maryland (1995)"},{"issue":"1","key":"4_CR4","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1145\/200836.200853","volume":"42","author":"P.B. Callahan","year":"1995","unstructured":"Callahan, P.B., Kosaraju, S.R.: A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields. J. ACM\u00a042(1), 67\u201390 (1995)","journal-title":"J. ACM"},{"issue":"2","key":"4_CR5","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0022-0000(89)90044-5","volume":"39","author":"L.P. Chew","year":"1989","unstructured":"Chew, L.P.: There are planar graphs almost as good as the complete graph. J. Comput. System Sci.\u00a039(2), 205\u2013219 (1989)","journal-title":"J. Comput. System Sci."},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Farshi, M., Gudmundsson, J.: Experimental study of geometric t-spanners. ACM J. Experimental Algorithmics\u00a014 (2009)","DOI":"10.1145\/1498698.1564499"},{"issue":"1","key":"4_CR7","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1109\/JSAC.2004.837364","volume":"23","author":"J. Gao","year":"2005","unstructured":"Gao, J., Guibas, L.J., Hershberger, J., Zhang, L., Zhu, A.: Geometric spanners for routing in mobile networks. IEEE J. Selected Areas in Communications\u00a023(1), 174\u2013185 (2005)","journal-title":"IEEE J. Selected Areas in Communications"},{"key":"4_CR8","unstructured":"Goldberg, A.V., Harrelson, C.: Computing the shortest path: A search meets graph theory. In: 16th ACM-SIAM Sympos. Discrete Algorithms, pp. 156\u2013165. SIAM (2005)"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Gudmundsson, J., Knauer, C.: Dilation and detours in geometric networks. In: Gonzales, T. (ed.) Handbook on Approximation Algorithms and Metaheuristics, pp. 52-1\u201352-16. Chapman & Hall\/CRC, Boca Raton (2006)","DOI":"10.1201\/9781420010749.ch52"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/3-540-19487-8_23","volume-title":"SWAT \u201988","author":"J.M. Keil","year":"1988","unstructured":"Keil, J.M.: Approximating the complete euclidean graph. In: Karlsson, R., Lingas, A. (eds.) SWAT 1988. LNCS, vol.\u00a0318, pp. 208\u2013213. Springer, Heidelberg (1988)"},{"key":"4_CR11","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":"4_CR12","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1002\/jgt.3190130114","volume":"13","author":"D. Peleg","year":"1989","unstructured":"Peleg, D., Sch\u00e4ffer, A.A.: Graph spanners. Journal of Graph Theory\u00a013(1), 99\u2013116 (1989)","journal-title":"Journal of Graph Theory"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40450-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T12:56:45Z","timestamp":1558011405000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40450-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642404498","9783642404504"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40450-4_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}