{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:15:40Z","timestamp":1763468140201},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642385261"},{"type":"electronic","value":"9783642385278"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38527-8_4","type":"book-chapter","created":{"date-parts":[[2013,5,8]],"date-time":"2013-05-08T09:23:02Z","timestamp":1368004982000},"page":"18-29","source":"Crossref","is-referenced-by-count":19,"title":["Hub Label Compression"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Delling","sequence":"first","affiliation":[]},{"given":"Andrew V.","family":"Goldberg","sequence":"additional","affiliation":[]},{"given":"Renato F.","family":"Werneck","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","unstructured":"Project OSRM (2012), \n                    \n                      http:\/\/project-osrm.org\/"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Abraham, I., Delling, D., Fiat, A., Goldberg, A.V., Werneck, R.F.: HLDB: Location-Based Services in Databases. In: Proc. SIGSPATIAL GIS, pp. 339\u2013348. ACM Press (2012)","DOI":"10.1145\/2424321.2424365"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/978-3-642-20662-7_20","volume-title":"Experimental Algorithms","author":"I. Abraham","year":"2011","unstructured":"Abraham, I., Delling, D., Goldberg, A.V., Werneck, R.F.: A Hub-Based Labeling Algorithm for Shortest Paths on Road Networks. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol.\u00a06630, pp. 230\u2013241. Springer, Heidelberg (2011)"},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-642-33090-2_4","volume-title":"Algorithms \u2013 ESA 2012","author":"I. Abraham","year":"2012","unstructured":"Abraham, I., Delling, D., Goldberg, A.V., Werneck, R.F.: Hierarchical Hub Labelings for Shortest Paths. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol.\u00a07501, pp. 24\u201335. Springer, Heidelberg (2012)"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/978-3-642-38527-8_7","volume-title":"SEA 2013","author":"J. Arz","year":"2013","unstructured":"Arz, J., Luxen, D., Sanders, P.: Transit Node Routing Reconsidered. In: Bonifaci, V., Demetrescu, C., Marchetti-Spaccamela, A. (eds.) SEA 2013. LNCS, vol.\u00a07933, pp. 55\u201366. Springer, Heidelberg (2013)"},{"issue":"5824","key":"4_CR6","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1126\/science.1137521","volume":"316","author":"H. Bast","year":"2007","unstructured":"Bast, H., Funke, S., Sanders, P., Schultes, D.: Fast Routing in Road Networks with Transit Nodes. Science\u00a0316(5824), 566 (2007)","journal-title":"Science"},{"issue":"2.4","key":"4_CR7","first-page":"1","volume":"14","author":"R. Bauer","year":"2009","unstructured":"Bauer, R., Delling, D.: SHARC: Fast and Robust Unidirectional Routing. ACM JEA\u00a014(2.4), 1\u201329 (2009)","journal-title":"ACM JEA"},{"issue":"2.3","key":"4_CR8","first-page":"1","volume":"15","author":"R. Bauer","year":"2010","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. ACM JEA\u00a015(2.3), 1\u201331 (2010)","journal-title":"ACM JEA"},{"issue":"5","key":"4_CR9","doi-asserted-by":"publisher","first-page":"1338","DOI":"10.1137\/S0097539702403098","volume":"32","author":"E. Cohen","year":"2003","unstructured":"Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and Distance Queries via 2-Hop Labels. SIAM J. Computing\u00a032(5), 1338\u20131355 (2003)","journal-title":"SIAM J. Computing"},{"key":"4_CR10","unstructured":"Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press (2001)"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/978-3-642-20662-7_32","volume-title":"Experimental Algorithms","author":"D. Delling","year":"2011","unstructured":"Delling, D., Goldberg, A.V., Pajor, T., Werneck, R.F.: Customizable Route Planning. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol.\u00a06630, pp. 376\u2013387. Springer, Heidelberg (2011)"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1007\/978-3-642-38527-8_5","volume-title":"SEA 2013","author":"D. Delling","year":"2013","unstructured":"Delling, D., Werneck, R.F.: Faster Customization of Road Networks. In: Bonifaci, V., Demetrescu, C., Marchetti-Spaccamela, A. (eds.) SEA 2013. LNCS, vol.\u00a07933, pp. 30\u201342. Springer, Heidelberg (2013)"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Demetrescu, C., Goldberg, A.V., Johnson, D.S. (eds.): The Shortest Path Problem: 9th DIMACS Implementation Challenge. DIMACS Book, vol. 74. AMS (2009)","DOI":"10.1090\/dimacs\/074"},{"key":"4_CR14","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A Note on Two Problems in Connexion with Graphs. Numerische Mathematik\u00a01, 269\u2013271 (1959)","journal-title":"Numerische Mathematik"},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.jalgor.2004.05.002","volume":"53","author":"C. Gavoille","year":"2004","unstructured":"Gavoille, C., Peleg, D., P\u00e9rennes, S., Raz, R.: Distance Labeling in Graphs. Journal of Algorithms\u00a053, 85\u2013112 (2004)","journal-title":"Journal of Algorithms"},{"issue":"3","key":"4_CR16","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1287\/trsc.1110.0401","volume":"46","author":"R. Geisberger","year":"2012","unstructured":"Geisberger, R., Sanders, P., Schultes, D., Vetter, C.: Exact Routing in Large Road Networks Using Contraction Hierarchies. Transportation Sci.\u00a046(3), 388\u2013404 (2012)","journal-title":"Transportation Sci."},{"key":"4_CR17","unstructured":"Goldberg, A.V., Harrelson, C.: Computing the Shortest Path: A* Search Meets Graph Theory. In: Proc. SODA 2005, pp. 156\u2013165. SIAM (2005)"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Goldberg, A.V., Kaplan, H., Werneck, R.F.: Reach for A*: Shortest Path Algorithms with Preprocessing. In: Demetrescu, et al. (eds.) [13], pp. 93\u2013139","DOI":"10.1090\/dimacs\/074\/05"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Lauther, U.: An Experimental Evaluation of Point-To-Point Shortest Path Calculation on Roadnetworks with Precalculated Edge-Flags. In: Demetrescu, et al. (eds.) [13], pp. 19\u201340","DOI":"10.1090\/dimacs\/074\/02"},{"key":"4_CR20","unstructured":"Munro, I., Rao, S.: Succinct representation of data structures. In: Mehta, D.P., Sahni, S. (eds.) Handbook of Data Structures and Applications. CRC (2004)"},{"key":"4_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"732","DOI":"10.1007\/978-3-540-87744-8_61","volume-title":"Algorithms - ESA 2008","author":"P. Sanders","year":"2008","unstructured":"Sanders, P., Schultes, D., Vetter, C.: Mobile Route Planning. In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol.\u00a05193, pp. 732\u2013743. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38527-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T21:46:28Z","timestamp":1558302388000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38527-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642385261","9783642385278"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38527-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}