{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:52:08Z","timestamp":1773481928875,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642130724","type":"print"},{"value":"9783642130731","type":"electronic"}],"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-13073-1_32","type":"book-chapter","created":{"date-parts":[[2010,5,10]],"date-time":"2010-05-10T04:09:58Z","timestamp":1273464598000},"page":"359-370","source":"Crossref","is-referenced-by-count":19,"title":["Preprocessing Speed-Up Techniques Is Hard"],"prefix":"10.1007","author":[{"given":"Reinhard","family":"Bauer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tobias","family":"Columbus","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bastian","family":"Katz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcus","family":"Krug","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dorothea","family":"Wagner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"32_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-642-02094-0_7","volume-title":"Algorithmics of Large and Complex Networks","author":"D. Delling","year":"2009","unstructured":"Delling, D., Sanders, P., Schultes, D., Wagner, D.: Engineering Route Planning Algorithms. In: Lerner, J., Wagner, D., Zweig, K.A. (eds.) Algorithmics of Large and Complex Networks. LNCS, vol.\u00a05515, pp. 117\u2013139. Springer, Heidelberg (2009)"},{"key":"32_CR2","unstructured":"Goldberg, A.V., Harrelson, C.: Computing the Shortest Path: A* Search Meets Graph Theory. In: Proceedings of the 16th Annual ACM\u2013SIAM Symposium on Discrete Algorithms (SODA 2005), pp. 156\u2013165 (2005)"},{"key":"32_CR3","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. IfGI prints. vol.\u00a022. pp. 219\u2013230 (2004)"},{"key":"32_CR4","series-title":"DIMACS Book","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1090\/dimacs\/074\/03","volume-title":"The Shortest Path Problem: Ninth DIMACS Implementation Challenge","author":"M. Hilger","year":"2009","unstructured":"Hilger, M., K\u00f6hler, E., M\u00f6hring, R.H., Schilling, H.: Fast Point-to-Point Shortest Path Computations with Arc-Flags. In: Demetrescu, C., Goldberg, A.V., Johnson, D.S. (eds.) The Shortest Path Problem: Ninth DIMACS Implementation Challenge. DIMACS Book, vol.\u00a074, pp. 41\u201372. American Mathematical Society, Providence (2009)"},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"Bauer, R., Delling, D.: SHARC: Fast and Robust Unidirectional Routing. ACM Journal of Experimental Algorithmics 14 (May 2009); 2.4 Special Section on Selected Papers from ALENEX 2008","DOI":"10.1145\/1498698.1537599"},{"key":"32_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/3-540-48318-7_11","volume-title":"Algorithm Engineering","author":"F. Schulz","year":"1999","unstructured":"Schulz, F., Wagner, D., Weihe, K.: Dijkstra\u2019s Algorithm On-Line: An Empirical Case Study from Public Railroad Transport. In: Vitter, J.S., Zaroliagis, C.D. (eds.) WAE 1999. LNCS, vol.\u00a01668, pp. 110\u2013123. Springer, Heidelberg (1999)"},{"key":"32_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-540-72845-0_6","volume-title":"Experimental Algorithms","author":"D. Schultes","year":"2007","unstructured":"Schultes, D., Sanders, P.: Dynamic Highway-Node Routing. In: Demetrescu, C. (ed.) WEA 2007. LNCS, vol.\u00a04525, pp. 66\u201379. Springer, Heidelberg (2007)"},{"key":"32_CR8","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1137\/1.9781611972863.15","volume-title":"Proceedings of the 8th Workshop on Algorithm Engineering and Experiments (ALENEX 2006)","author":"M. Holzer","year":"2006","unstructured":"Holzer, M., Schulz, F., Wagner, D.: Engineering Multi-Level Overlay Graphs for Shortest-Path Queries. In: Proceedings of the 8th Workshop on Algorithm Engineering and Experiments (ALENEX 2006), pp. 156\u2013170. SIAM, Philadelphia (2006)"},{"key":"32_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-540-68552-4_24","volume-title":"Experimental Algorithms","author":"R. Geisberger","year":"2008","unstructured":"Geisberger, R., Sanders, P., Schultes, D., Delling, D.: Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol.\u00a05038, pp. 319\u2013333. Springer, Heidelberg (2008)"},{"key":"32_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"776","DOI":"10.1007\/978-3-540-39658-1_69","volume-title":"Algorithms - ESA 2003","author":"D. Wagner","year":"2003","unstructured":"Wagner, D., Willhalm, T.: Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol.\u00a02832, pp. 776\u2013787. Springer, Heidelberg (2003)"},{"key":"32_CR11","doi-asserted-by":"crossref","unstructured":"Wagner, D., Willhalm, T., Zaroliagis, C.: Geometric Containers for Efficient Shortest-Path Computation. ACM Journal of Experimental Algorithmics\u00a010, 1.3 (2005)","DOI":"10.1145\/1064546.1103378"},{"key":"32_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1007\/11561071_51","volume-title":"Proceedings of the 13th Annual European Symposium on Algorithms (ESA\u201905)","author":"P. Sanders","year":"2005","unstructured":"Sanders, P., Schultes, D.: Highway Hierarchies Hasten Exact Shortest Path Queries. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol.\u00a03669, pp. 568\u2013579. Springer, Heidelberg (2005)"},{"key":"32_CR13","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":"32_CR14","first-page":"100","volume-title":"Proceedings of the 6th Workshop on Algorithm Engineering and Experiments (ALENEX 2004)","author":"R.J. Gutman","year":"2004","unstructured":"Gutman, R.J.: Reach-Based Routing: A New Approach to Shortest Path Algorithms Optimized for Road Networks. In: Proceedings of the 6th Workshop on Algorithm Engineering and Experiments (ALENEX 2004), pp. 100\u2013111. SIAM, Philadelphia (2004)"},{"key":"32_CR15","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1137\/1.9781611972863.13","volume-title":"Proceedings of the 8th Workshop on Algorithm Engineering and Experiments (ALENEX 2006)","author":"A.V. Goldberg","year":"2006","unstructured":"Goldberg, A.V., Kaplan, H., Werneck, R.F.: Reach for A*: Efficient Point-to-Point Shortest Path Algorithms. In: Proceedings of the 8th Workshop on Algorithm Engineering and Experiments (ALENEX 2006), pp. 129\u2013143. SIAM, Philadelphia (2006)"},{"key":"32_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/978-3-540-72845-0_4","volume-title":"Experimental Algorithms","author":"A.V. Goldberg","year":"2007","unstructured":"Goldberg, A.V., Kaplan, H., Werneck, R.F.: Better Landmarks Within Reach. In: Demetrescu, C. (ed.) WEA 2007. LNCS, vol.\u00a04525, pp. 38\u201351. Springer, Heidelberg (2007)"},{"key":"32_CR17","unstructured":"Sanders, P., Schultes, D.: Robust, Almost Constant Time Shortest-Path Queries in Road Networks. In: Demetrescu, C., Goldberg, A.V., Johnson, D.S. (eds.) 9th DIMACS Implementation Challenge - Shortest Paths (November 2006)"},{"key":"32_CR18","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1137\/1.9781611972870.5","volume-title":"Proceedings of the 9th Workshop on Algorithm Engineering and Experiments (ALENEX 2007)","author":"H. Bast","year":"2007","unstructured":"Bast, H., Funke, S., Matijevic, D., Sanders, P., Schultes, D.: In Transit to Constant Shortest-Path Queries in Road Networks. In: Proceedings of the 9th Workshop on Algorithm Engineering and Experiments (ALENEX 2007), pp. 46\u201359. SIAM, Philadelphia (2007)"},{"key":"32_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-540-95891-8_13","volume-title":"SOFSEM 2009: Theory and Practice of Computer Science","author":"R. Bauer","year":"2009","unstructured":"Bauer, R., D\u2019Angelo, G., Delling, D., Wagner, D.: The Shortcut Problem \u2013 Complexity and Approximation. In: Nielsen, M., Kucera, A., Miltersen, P.B., Palamidessi, C., Tuma, P., Valencia, F.D. (eds.) SOFSEM 2009. LNCS, vol.\u00a05404, pp. 105\u2013116. Springer, Heidelberg (2009)"},{"key":"32_CR20","doi-asserted-by":"crossref","unstructured":"Abraham, I., Fiat, A., Goldberg, A.V., Werneck, R.F.: Highway Dimension, Shortest Paths, and Provably Efficient Algorithms. In: Proceedings of the 21st Annual ACM\u2013SIAM Symposium on Discrete Algorithms (SODA 2010), pp. 782\u2013793 (2010)","DOI":"10.1137\/1.9781611973075.64"},{"key":"32_CR21","unstructured":"Bauer, R., Columbus, T., Katz, B., Krug, M., Wagner, D.: Preprocessing Speed-Up Techniques is Hard. Technical Report 2010-04, ITI Wagner, Faculty of Informatics, Universit\u00e4t Karlsruhe, TH (2010), http:\/\/digbib.ubka.uni-karlsruhe.de\/volltexte\/1000016080"},{"key":"32_CR22","volume-title":"Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems","author":"D. Eppstein","year":"2008","unstructured":"Eppstein, D., Goodrich, M.T.: Studying (non-planar) road networks through an algorithmic lens. In: Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems. ACM Press, New York (2008)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13073-1_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T22:46:34Z","timestamp":1559083594000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13073-1_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642130724","9783642130731"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13073-1_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}