{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:57:13Z","timestamp":1725573433417},"publisher-location":"Berlin, Heidelberg","reference-count":15,"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_85","type":"book-chapter","created":{"date-parts":[[2005,12,2]],"date-time":"2005-12-02T03:24:24Z","timestamp":1133493864000},"page":"849-858","source":"Crossref","is-referenced-by-count":0,"title":["Exact and Approximation Algorithms for Computing the Dilation Spectrum of Paths, Trees, and Cycles"],"prefix":"10.1007","author":[{"given":"Rolf","family":"Klein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Knauer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giri","family":"Narasimhan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michiel","family":"Smid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"85_CR1","unstructured":"Agarwal, P., 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 (to appear in Discrete and Computational Geometry)"},{"key":"85_CR2","unstructured":"Agarwal, P., Klein, R., Knauer, C., Sharir, M.: Computing the detour of polygonal curves. Technical Report B 02-03, Freie Universit\u00e4t Berlin, Fachbereich Mathematik und Informatik (2002)"},{"key":"85_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. J. ACM\u00a042, 67\u201390 (1995)","journal-title":"J. ACM"},{"key":"85_CR4","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"1990","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press, Cambridge (1990)"},{"key":"85_CR5","first-page":"425","volume-title":"Handbook of Computational Geometry","author":"D. Eppstein","year":"1999","unstructured":"Eppstein, D.: Spanning trees and spanners. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 425\u2013461. Elsevier Science, Amsterdam (1999)"},{"key":"85_CR6","doi-asserted-by":"crossref","unstructured":"Farshi, M., Giannopoulos, P., Gudmundsson, J.: Finding the best shortcut in a geometric network. In: 21st Ann. ACM Symp. Comput. Geom., pp.\u00a0327\u2013335 (2005)","DOI":"10.1145\/1064092.1064143"},{"key":"85_CR7","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 J. Comput.\u00a016, 1004\u20131022 (1987)","journal-title":"SIAM J. Comput."},{"key":"85_CR8","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BF02187876","volume":"2","author":"D. Haussler","year":"1987","unstructured":"Haussler, D., Welzl, E.: Epsilon-nets and simplex range queries. Discrete Comput. Geom.\u00a02, 127\u2013151 (1987)","journal-title":"Discrete Comput. Geom."},{"key":"85_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/3-540-45841-7_20","volume-title":"STACS 2002","author":"S. Langerman","year":"2002","unstructured":"Langerman, S., Morin, P., Soss, M.: Computing the maximum detour and spanning ratio of planar chains, trees and cycles. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol.\u00a02285, pp. 250\u2013261. Springer, Heidelberg (2002)"},{"key":"85_CR10","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF01200757","volume":"15","author":"N. Linial","year":"1995","unstructured":"Linial, N., London, E., Rabinovich, Y.: The geometry of graphs and some of its algorithmic applications. Combinatorica\u00a015, 215\u2013245 (1995)","journal-title":"Combinatorica"},{"issue":"3","key":"85_CR11","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 J. Comput.\u00a030(3), 978\u2013989 (2000)","journal-title":"SIAM J. Comput."},{"key":"85_CR12","unstructured":"Narasimhan, G., Smid, M.: Geometric Spanner Networks. Cambridge University Press, Cambridge (to appear)"},{"key":"85_CR13","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.: Graph spanners. J. Graph Theory\u00a013, 99\u2013116 (1989)","journal-title":"J. Graph Theory"},{"key":"85_CR14","volume-title":"Davenport-Schinzel sequences and their geometric applications","author":"M. Sharir","year":"1995","unstructured":"Sharir, M., Agarwal, P.: Davenport-Schinzel sequences and their geometric applications. Cambridge University Press, New York (1995)"},{"key":"85_CR15","first-page":"877","volume-title":"Handbook of Computational Geometry","author":"M. Smid","year":"1999","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, Amsterdam (1999)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11602613_85.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:03:12Z","timestamp":1619492592000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11602613_85"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540309352","9783540324263"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11602613_85","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}