{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:56:00Z","timestamp":1725573360572},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540309352"},{"type":"electronic","value":"9783540324263"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11602613_7","type":"book-chapter","created":{"date-parts":[[2005,12,2]],"date-time":"2005-12-02T03:24:24Z","timestamp":1133493864000},"page":"50-59","source":"Crossref","is-referenced-by-count":7,"title":["Sparse Geometric Graphs with Small Dilation"],"prefix":"10.1007","author":[{"given":"Boris","family":"Aronov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"de Berg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Otfried","family":"Cheong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joachim","family":"Gudmundsson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Herman","family":"Haverkort","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antoine","family":"Vigneron","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"7_CR1","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1109\/TPDS.2003.1195412","volume":"14","author":"K. Alzoubi","year":"2003","unstructured":"Alzoubi, K., Li, X.-Y., Wang, Y., Wan, P.-J., Frieder, O.: Geometric spanners for wireless ad hoc networks. IEEE Trans. Parallel Dist. Systems\u00a014(4), 408\u2013421 (2003)","journal-title":"IEEE Trans. Parallel Dist. Systems"},{"key":"7_CR2","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, 67\u201390 (1995)","journal-title":"J. ACM"},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1142\/S0218195995000088","volume":"5","author":"B. Chandra","year":"1995","unstructured":"Chandra, B., Das, G., Narasimhan, G., Soares, J.: New sparseness results on graph spanners. Internat. J. Comput. Geom. Appl.\u00a05, 124\u2013144 (1995)","journal-title":"Internat. J. Comput. Geom. Appl."},{"issue":"2","key":"7_CR4","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1142\/S0129054196000105","volume":"7","author":"G. Das","year":"1996","unstructured":"Das, G., Heffernan, P.: Constructing Degree\u20133 Spanners with Other Sparseness Properties. Int. J. Found. Comput. Sci.\u00a07(2), 121\u2013136 (1996)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"7_CR5","volume-title":"Differential Geometry of Curves and Surfaces","author":"M. Carmo do","year":"1976","unstructured":"do Carmo, M.: Differential Geometry of Curves and Surfaces. Prentice Hall, Englewood Cliffs (1976)"},{"key":"7_CR6","unstructured":"Emek, Y., Peleg, D.: Approximating minimum max-stretch spanning trees on unweighted graphs (full version). In: Proc. ACM-SIAM Symp. Discrete Algo., pp. 261\u2013270 (2004)"},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/B978-044482537-7\/50010-3","volume-title":"Handbook of Computational Geometry","author":"D. Eppstein","year":"2000","unstructured":"Eppstein, D.: Spanning trees and spanners. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 425\u2013461. Elsevier Science Publishers, Amsterdam (2000)"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Eppstein, D., Wortman, K.: Minimum dilation stars. In: Proc. ACM Symp. Comput. Geom., pp. 321\u2013326 (2005)","DOI":"10.1145\/1064092.1064142"},{"issue":"2","key":"7_CR9","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0166-218X(03)00259-2","volume":"137","author":"A.M. Farley","year":"2004","unstructured":"Farley, A.M., Proskurowski, A., Zappala, D., Windisch, K.J.: Spanners and message distribution in networks. Discrete Appl. Math.\u00a0137(2), 159\u2013171 (2004)","journal-title":"Discrete Appl. Math."},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/S0166-218X(00)00226-2","volume":"108","author":"S.P. Fekete","year":"2001","unstructured":"Fekete, S.P., Kremer, J.: Tree spanners in planar graphs. Discrete Appl. Math.\u00a0108, 85\u2013103 (2001)","journal-title":"Discrete Appl. Math."},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BF02187821","volume":"7","author":"J.M. Keil","year":"1992","unstructured":"Keil, J.M., Gutwin, C.A.: Classes of graphs which approximate the complete Euclidean graph. Discrete Comput. Geom.\u00a07, 13\u201328 (1992)","journal-title":"Discrete Comput. Geom."},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/BF01758846","volume":"8","author":"C. Levcopoulos","year":"1992","unstructured":"Levcopoulos, C., Lingas, A.: There are planar graphs almost as good as the complete graphs and almost as cheap as minimum spanning trees. Algorithmica\u00a08, 251\u2013256 (1992)","journal-title":"Algorithmica"},{"key":"7_CR13","volume-title":"Ad Hoc Wireless Networking","author":"X.-Y. Li","year":"2003","unstructured":"Li, X.-Y.: Applications of computational geomety in wireless ad hoc networks. In: Cheng, X.-Z., Huang, X., Du, D.-Z. (eds.) Ad Hoc Wireless Networking. Kluwer, Dordrecht (2003)"},{"key":"7_CR14","first-page":"69","volume-title":"Proc. 5th Workshop Algorithm Eng. Exp.","author":"G. Navarro","year":"2003","unstructured":"Navarro, G., Paredes, R.: Practical construction of metric t-spanners. In: Proc. 5th Workshop Algorithm Eng. Exp., pp. 69\u201381. SIAM Press, Philadelphia (2003)"},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/3-540-45735-6_26","volume-title":"String Processing and Information Retrieval","author":"G. Navarro","year":"2002","unstructured":"Navarro, G., Paredes, R., Ch\u00e1vez, E.: t-spanners as a data structure for metric space searching. In: Laender, A.H.F., Oliveira, A.L. (eds.) SPIRE 2002. LNCS, vol.\u00a02476, pp. 298\u2013309. Springer, Heidelberg (2002)"},{"key":"7_CR16","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1142\/S0218195991000098","volume":"1","author":"J.S. Salowe","year":"1991","unstructured":"Salowe, J.S.: Constructing multidimensional spanner graphs. Internat. J. Comput. Geom.\u00a01, 99\u2013107 (1991)","journal-title":"Internat. J. Comput. Geom."},{"key":"7_CR17","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1016\/B978-044482537-7\/50021-8","volume-title":"Handbook of Computational Geometry","author":"M. Smid","year":"2000","unstructured":"Smid, M.: Closest point problems in computational geometry. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 877\u2013935. Elsevier Science Publishers, Amsterdam (2000)"},{"key":"7_CR18","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/BF02574695","volume":"6","author":"P.M. Vaidya","year":"1991","unstructured":"Vaidya, P.M.: A sparse graph almost as good as the complete graph on points in K dimensions. Discrete Comput. Geom.\u00a06, 369\u2013381 (1991)","journal-title":"Discrete Comput. Geom."},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: On constructing minimum spanning trees in k-dimensional spaces and related problems. SIAM J. Comput.\u00a011 (1992)","DOI":"10.1137\/0211059"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11602613_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T05:15:57Z","timestamp":1586582157000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11602613_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540309352","9783540324263"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11602613_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}