{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:57:30Z","timestamp":1725537450037},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642041273"},{"type":"electronic","value":"9783642041280"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04128-0_17","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T14:16:36Z","timestamp":1252937796000},"page":"190-202","source":"Crossref","is-referenced-by-count":1,"title":["Geometric Spanners for Weighted Point Sets"],"prefix":"10.1007","author":[{"given":"Mohammad","family":"Ali Abam","sequence":"first","affiliation":[]},{"given":"Mark","family":"de Berg","sequence":"additional","affiliation":[]},{"given":"Mohammad","family":"Farshi","sequence":"additional","affiliation":[]},{"given":"Joachim","family":"Gudmundsson","sequence":"additional","affiliation":[]},{"given":"Michiel","family":"Smid","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_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, Cambridge (2007)"},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"1148","DOI":"10.1137\/S0097539704446281","volume":"35","author":"S. Har-Peled","year":"2006","unstructured":"Har-Peled, S., Mendel, M.: Fast construction of nets in low-dimensional metrics and their applications. SIAM J. on Computing\u00a035, 1148\u20131184 (2006)","journal-title":"SIAM J. on Computing"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Talwar, K.: Bypassing the embedding: algorithms for low dimensional metrics. In: STOC 2004, pp. 281\u2013290 (2004)","DOI":"10.1145\/1007352.1007399"},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/978-3-540-69903-3_33","volume-title":"Algorithm Theory \u2013 SWAT 2008","author":"P. Bose","year":"2008","unstructured":"Bose, P., Carmi, P., Couture, M.: Spanners of additively weighted point sets. In: Gudmundsson, J. (ed.) SWAT 2008. LNCS, vol.\u00a05124, pp. 367\u2013377. Springer, Heidelberg (2008)"},{"key":"17_CR5","unstructured":"Abam, M.A., de Berg, M., Farshi, M., Gudmundsson, J.: Region-fault tolerant geometric spanners. In: SODA 2007, pp. 1\u201310 (2007)"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Varadarajan, K.R.: A divide-and-conquer algorithm for min-cost perfect matching in the plane. In: FOCS 1998, pp. 320\u2013331 (1998)","DOI":"10.1109\/SFCS.1998.743466"},{"key":"17_CR7","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. of the ACM\u00a042, 67\u201390 (1995)","journal-title":"J. of the ACM"},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1145\/293347.293348","volume":"45","author":"S. Arya","year":"1998","unstructured":"Arya, S., Mount, D.M., Netanyahu, N.S., Silverman, R., Wu, A.: An optimal algorithm for approximate nearest neighbor searching in fixed dimensions. J. of the ACM\u00a045, 891\u2013923 (1998)","journal-title":"J. of the ACM"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1007\/978-3-540-87744-8_40","volume-title":"Algorithms - ESA 2008","author":"L.A. Gottlieb","year":"2008","unstructured":"Gottlieb, L.A., Roditty, L.: An optimal dynamic spanner for doubling metric spaces. In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol.\u00a05193, pp. 478\u2013489. Springer, Heidelberg (2008)"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Cole, R., Gottlieb, L.A.: Searching dynamic point sets in spaces with bounded doubling dimension. In: STOC 2006, pp. 574\u2013583 (2006)","DOI":"10.1145\/1132516.1132599"},{"key":"17_CR11","unstructured":"Callahan, P.B., Kosaraju, S.R.: Faster algorithms for some geometric graph problems in higher dimensions. In: SODA 1993, pp. 291\u2013300 (1993)"},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1145\/263867.263869","volume":"44","author":"P.K. Agarwal","year":"1997","unstructured":"Agarwal, P.K., Har-Peled, S., Sharir, M., Varadarajan, K.R.: Approximate shortest paths on a convex polytope in three dimensions. J. of the ACM\u00a044, 567\u2013584 (1997)","journal-title":"J. of the ACM"},{"key":"17_CR13","first-page":"6037","volume":"258","author":"G. Hansel","year":"1964","unstructured":"Hansel, G.: Nombre minimal de contacts de fermeture n\u00e9cessaires pour r\u00e9aliser une fonction bool\u00e9enne sym\u00e9trique de n variables. Comptes Rendus de l\u2019Acad\u00e9mie des Sciences\u00a0258, 6037\u20136040 (1964)","journal-title":"Comptes Rendus de l\u2019Acad\u00e9mie des Sciences"},{"key":"17_CR14","doi-asserted-by":"publisher","first-page":"1068","DOI":"10.1016\/j.ejc.2006.04.003","volume":"28","author":"B. Bollob\u00e1s","year":"2007","unstructured":"Bollob\u00e1s, B., Scott, A.D.: On separating systems. European J. of Combinatorics\u00a028, 1068\u20131071 (2007)","journal-title":"European J. of Combinatorics"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04128-0_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T14:49:36Z","timestamp":1552142976000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04128-0_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642041273","9783642041280"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04128-0_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}