{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T08:44:12Z","timestamp":1743151452609,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540958901"},{"type":"electronic","value":"9783540958918"}],"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-540-95891-8_13","type":"book-chapter","created":{"date-parts":[[2009,1,22]],"date-time":"2009-01-22T01:19:21Z","timestamp":1232587161000},"page":"105-116","source":"Crossref","is-referenced-by-count":4,"title":["The Shortcut Problem \u2013 Complexity and Approximation"],"prefix":"10.1007","author":[{"given":"Reinhard","family":"Bauer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gianlorenzo","family":"D\u2019Angelo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Delling","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dorothea","family":"Wagner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","unstructured":"PTV AG - Planung Transport Verkehr (1979), http:\/\/www.ptv.de"},{"key":"13_CR2","unstructured":"Proceedings of the 8th Workshop on Algorithm Engineering and Experiments (ALENEX 2006). SIAM, Philadelphia (2006)"},{"key":"13_CR3","unstructured":"Bauer, R., D\u2019Angelo, G., Delling, D., Wagner, D.: The Shortcut Problem \u2013 Complexity and Approximation (Full Version), http:\/\/i11www.iti.uni-karlsruhe.de\/members\/rbauer\/pdf\/bddw-SOFSEM09_FULL.pdf"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1137\/1.9781611972887.2","volume-title":"Proceedings of the 10th Workshop on Algorithm Engineering and Experiments (ALENEX 2008)","author":"R. Bauer","year":"2008","unstructured":"Bauer, R., Delling, D.: SHARC: Fast and Robust Unidirectional Routing. In: Proceedings of the 10th Workshop on Algorithm Engineering and Experiments (ALENEX 2008), pp. 13\u201326. SIAM, Philadelphia (2008)"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Bauer, R., Delling, D., Sanders, P., Schieferdecker, D., Schultes, D., Wagner, D.: Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra\u2019s Algorithm. In: McGeoch (ed.) [15], pp. 303\u2013318","DOI":"10.1007\/978-3-540-68552-4_23"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Bruera, F., Cicerone, S., D\u2019Angelo, G., Stefano, G.D., Frigioni, D.: Dynamic Multi-level Overlay Graphs for Shortest Paths. Mathematics in Computer Science\u00a01(4) (2008)","DOI":"10.1007\/s11786-007-0023-5"},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","volume-title":"Experimental Algorithms","year":"2007","unstructured":"Demetrescu, C. (ed.): WEA 2007. LNCS, vol.\u00a04525. Springer, Heidelberg (2007)"},{"key":"13_CR8","unstructured":"Demetrescu, C., Goldberg, A.V., Johnson, D.S. (eds.): 9th DIMACS Implementation Challenge - Shortest Paths (November 2006)"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Geisberger, R., Sanders, P., Schultes, D., Delling, D.: Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks. In: McGeoch (ed.) [15], pp. 319\u2013333","DOI":"10.1007\/978-3-540-68552-4_24"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Goldberg, A.V., Kaplan, H., Werneck, R.F.: Reach for A*: Efficient Point-to-Point Shortest Path Algorithms. In: ALENEX 2006 [2], pp. 129\u2013143 (2006)","DOI":"10.1137\/1.9781611972863.13"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Goldberg, A.V., Kaplan, H., Werneck, R.F.: Better Landmarks Within Reach. In: Demetrescu (ed.) [7], pp. 38\u201351","DOI":"10.1007\/978-3-540-72845-0_4"},{"issue":"301","key":"13_CR12","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1080\/01621459.1963.10500830","volume":"58","author":"W. Hoeffding","year":"1963","unstructured":"Hoeffding, W.: Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association\u00a058(301), 713\u2013721 (1963)","journal-title":"Journal of the American Statistical Association"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Holzer, M., Schulz, F., Wagner, D.: Engineering Multi-Level Overlay Graphs for Shortest-Path Queries. In: ALENEX 2006 [2] (2006)","DOI":"10.1137\/1.9781611972863.15"},{"key":"13_CR14","unstructured":"Lauther, U.: An Extremely Fast, Exact Algorithm for Finding Shortest Paths in Static Networks with Geographical Background. In: Geoinformation und Mobilit\u00e4t - von der Forschung zur praktischen Anwendung, vol.\u00a022, pp. 219\u2013230. IfGI prints (2004)"},{"key":"13_CR15","series-title":"Lecture Notes in Computer Science","volume-title":"Experimental Algorithms","year":"2008","unstructured":"McGeoch, C.C. (ed.): WEA 2008. LNCS, vol.\u00a05038. Springer, Heidelberg (2008)"},{"key":"13_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1007\/11841036_71","volume-title":"Algorithms \u2013 ESA 2006","author":"P. Sanders","year":"2006","unstructured":"Sanders, P., Schultes, D.: Engineering Highway Hierarchies. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol.\u00a04168, pp. 804\u2013816. Springer, Heidelberg (2006)"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Sanders, P., Schultes, D.: Engineering Fast Route Planning Algorithms. In: Demetrescu (ed.) [7], pp. 23\u201336","DOI":"10.1007\/978-3-540-72845-0_2"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Schultes, D., Sanders, P.: Dynamic Highway-Node Routing. In: Demetrescu (ed.) [7], pp. 66\u201379","DOI":"10.1007\/978-3-540-72845-0_6"},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"Schulz, F., Wagner, D., Weihe, K.: Dijkstra\u2019s Algorithm On-Line: An Empirical Case Study from Public Railroad Transport. ACM Journal of Experimental Algorithmics, 5 (2000)","DOI":"10.1145\/351827.384254"},{"key":"13_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/3-540-45643-0_4","volume-title":"Algorithm Engineering and Experiments","author":"F. Schulz","year":"2002","unstructured":"Schulz, F., Wagner, D., Zaroliagis, C.: Using Multi-Level Graphs for Timetable Information in Railway Systems. In: Mount, D.M., Stein, C. (eds.) ALENEX 2002. LNCS, vol.\u00a02409, pp. 43\u201359. Springer, Heidelberg (2002)"},{"key":"13_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-540-70918-3_3","volume-title":"STACS 2007","author":"D. Wagner","year":"2007","unstructured":"Wagner, D., Willhalm, T.: Speed-Up Techniques for Shortest-Path Computations. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol.\u00a04393, pp. 23\u201336. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2009: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-95891-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T08:22:17Z","timestamp":1558081337000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-95891-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783540958901","9783540958918"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-95891-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}