{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:07:27Z","timestamp":1725570447518},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642175169"},{"type":"electronic","value":"9783642175176"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-17517-6_6","type":"book-chapter","created":{"date-parts":[[2010,12,3]],"date-time":"2010-12-03T20:13:41Z","timestamp":1291407221000},"page":"37-48","source":"Crossref","is-referenced-by-count":0,"title":["Approximating the Average Stretch Factor of Geometric Graphs"],"prefix":"10.1007","author":[{"given":"Siu-Wing","family":"Cheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Knauer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Langerman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michiel","family":"Smid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s00454-007-9019-9","volume":"39","author":"P.K. Agarwal","year":"2008","unstructured":"Agarwal, P.K., Klein, R., Knauer, C., Langerman, S., Morin, P., Sharir, M., Soss, M.: Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D. Discrete & Computational Geometry\u00a039, 17\u201337 (2008)","journal-title":"Discrete & Computational Geometry"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/3-540-61680-2_79","volume-title":"Algorithms - ESA \u201996","author":"S. Arikati","year":"1996","unstructured":"Arikati, S., Chen, D.Z., Chew, L.P., Das, G., Smid, M., Zaroliagis, C.D.: Planar spanners and approximate shortest path queries among obstacles in the plane. In: D\u00edaz, J. (ed.) ESA 1996. LNCS, vol.\u00a01136, pp. 514\u2013528. Springer, Heidelberg (1996)"},{"key":"6_CR3","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. Journal of the ACM\u00a042, 67\u201390 (1995)","journal-title":"Journal of the ACM"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1137\/050635675","volume":"38","author":"M. Farshi","year":"2008","unstructured":"Farshi, M., Giannopoulos, P., Gudmundsson, J.: Improving the stretch factor of a geometric graph by edge augmentation. SIAM Journal on Computing\u00a038, 226\u2013240 (2008)","journal-title":"SIAM Journal on Computing"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"1004","DOI":"10.1137\/0216064","volume":"16","author":"G.N. Frederickson","year":"1987","unstructured":"Frederickson, G.N.: Fast algorithms for shortest paths in planar graphs, with applications. SIAM Journal on Computing\u00a016, 1004\u20131022 (1987)","journal-title":"SIAM Journal on Computing"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"923","DOI":"10.1016\/j.comgeo.2009.03.004","volume":"42","author":"R. Klein","year":"2009","unstructured":"Klein, R., Knauer, C., Narasimhan, G., Smid, M.: On the dilation spectrum of paths, cycles, and trees. Computational Geometry: Theory and Applications\u00a042, 923\u2013933 (2009)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"978","DOI":"10.1137\/S0097539799361671","volume":"30","author":"G. Narasimhan","year":"2000","unstructured":"Narasimhan, G., Smid, M.: Approximating the stretch factor of Euclidean graphs. SIAM Journal on Computing\u00a030, 978\u2013989 (2000)","journal-title":"SIAM Journal on Computing"},{"key":"6_CR8","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":"6_CR9","unstructured":"Wulff-Nilsen, C.: Wiener index and diameter of a planar graph in subquadratic time. In: EuroCG, pp. 25\u201328 (2009)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17517-6_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T16:42:02Z","timestamp":1553272922000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17517-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642175169","9783642175176"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17517-6_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}