{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T22:35:15Z","timestamp":1784673315741,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540921813","type":"print"},{"value":"9783540921820","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-92182-0_67","type":"book-chapter","created":{"date-parts":[[2008,12,10]],"date-time":"2008-12-10T02:38:06Z","timestamp":1228876686000},"page":"764-775","source":"Crossref","is-referenced-by-count":5,"title":["Computing Best and Worst Shortcuts of Graphs Embedded in Metric Spaces"],"prefix":"10.1007","author":[{"given":"Jun","family":"Luo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christian","family":"Wulff-Nilsen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"67_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-540-77120-3_10","volume-title":"Algorithms and Computation","author":"H.-K. Ahn","year":"2007","unstructured":"Ahn, H.-K., Farshi, M., Knauer, C., Smid, M., Wang, Y.: Dilation-optimal edge deletion in polygonal cycles. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol.\u00a04835, pp. 88\u201399. Springer, Heidelberg (2007)"},{"key":"67_CR2","doi-asserted-by":"crossref","unstructured":"Chan, T.M.: More algorithms for all-pairs shortest paths in weighted graphs. In: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, pp. 590\u2013598 (2007)","DOI":"10.1145\/1250790.1250877"},{"key":"67_CR3","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":"67_CR4","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. 327\u2013335 (2005)","DOI":"10.1145\/1064092.1064143"},{"key":"67_CR5","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":"67_CR6","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":"67_CR7","unstructured":"Wulff-Nilsen, C.: Computing the Dilation of Edge-Augmented Graphs in Metric Spaces. In: 24th European Workshop on Computational Geometry, Nancy, pp. 123\u2013126 (2008)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92182-0_67","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,4]],"date-time":"2019-03-04T10:12:26Z","timestamp":1551694346000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92182-0_67"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540921813","9783540921820"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92182-0_67","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}