{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T17:14:03Z","timestamp":1774631643890,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642330896","type":"print"},{"value":"9783642330902","type":"electronic"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-33090-2_4","type":"book-chapter","created":{"date-parts":[[2012,8,28]],"date-time":"2012-08-28T11:29:11Z","timestamp":1346153351000},"page":"24-35","source":"Crossref","is-referenced-by-count":143,"title":["Hierarchical Hub Labelings for Shortest Paths"],"prefix":"10.1007","author":[{"given":"Ittai","family":"Abraham","sequence":"first","affiliation":[]},{"given":"Daniel","family":"Delling","sequence":"additional","affiliation":[]},{"given":"Andrew V.","family":"Goldberg","sequence":"additional","affiliation":[]},{"given":"Renato F.","family":"Werneck","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1007\/978-3-642-22006-7_58","volume-title":"Automata, Languages and Programming","author":"I. Abraham","year":"2011","unstructured":"Abraham, I., Delling, D., Fiat, A., Goldberg, A.V., Werneck, R.F.: VC-Dimension and Shortest Path Algorithms. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011. LNCS, vol.\u00a06755, pp. 690\u2013699. Springer, Heidelberg (2011)"},{"key":"4_CR2","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 in Road Networks. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol.\u00a06630, pp. 230\u2013241. Springer, Heidelberg (2011)"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Abraham, I., Delling, D., Goldberg, A.V., Werneck, R.F.: Hierarchical Hub Labelings for Shortest Paths. MSR-TR-2012-46. Microsoft Research (2012)","DOI":"10.1007\/978-3-642-33090-2_4"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Abraham, I., Fiat, A., Goldberg, A.V., Werneck, R.F.: Highway Dimension, Shortest Paths, and Provably Efficient Algorithms. In: SODA, pp. 782\u2013793 (2010)","DOI":"10.1137\/1.9781611973075.64"},{"key":"4_CR5","unstructured":"Bader, D.A., Meyerhenke, H., Sanders, P., Wagner, D.: 10th DIMACS Implementation Challenge \u2013 Graph Partitioning and Graph Clustering (2011)"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Bast, H., Funke, S., Matijevic, D., Sanders, P., Schultes, D.: In Transit to Constant Shortest-Path Queries in Road Networks. In: ALENEX, pp. 46\u201359 (2007)","DOI":"10.1137\/1.9781611972870.5"},{"issue":"2.3","key":"4_CR7","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 J. of Exp. Algo.\u00a015(2.3), 1\u201331 (2010)","journal-title":"ACM J. of Exp. Algo."},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Cheng, J., Yu, J.X.: On-line Exact Shortest Distance Query Processing. In: EDBT, pp. 481\u2013492. ACM Press (2009)","DOI":"10.1145\/1516360.1516417"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and Distance Queries via 2-hop Labels. SIAM J. Comput.\u00a032 (2003)","DOI":"10.1137\/S0097539702403098"},{"key":"4_CR10","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_CR11","unstructured":"Delling, D., Goldberg, A.V., Werneck, R.F.: Faster Batched Shortest Paths in Road Networks. In: ATMOS, OASIcs, vol.\u00a020, pp. 52\u201363 (2011)"},{"key":"4_CR12","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":"4_CR13","doi-asserted-by":"crossref","unstructured":"Demetrescu, C., Goldberg, A.V., Johnson, D.S. (eds.): The Shortest Path Problem: Ninth DIMACS Implementation Challenge. DIMACS, vol.\u00a074. 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":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"M.L. Fredman","year":"1987","unstructured":"Fredman, M.L., Tarjan, R.E.: Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms. J. Assoc. Comput. Mach.\u00a034, 596\u2013615 (1987)","journal-title":"J. Assoc. Comput. Mach."},{"key":"4_CR16","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"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Geisberger, R., Sanders, P., Schultes, D., Vetter, C.: Exact Routing in Large Road Networks Using Contraction Hierarchies. Transportation Science (2012)","DOI":"10.1287\/trsc.1110.0401"},{"key":"4_CR18","doi-asserted-by":"publisher","first-page":"1637","DOI":"10.1137\/070698774","volume":"37","author":"A.V. Goldberg","year":"2008","unstructured":"Goldberg, A.V.: A Practical Shortest Path Algorithm with Linear Expected Time. SIAM Journal on Computing\u00a037, 1637\u20131655 (2008)","journal-title":"SIAM Journal on Computing"},{"key":"4_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-642-13193-6_8","volume-title":"Experimental Algorithms","author":"T. Kieritz","year":"2010","unstructured":"Kieritz, T., Luxen, D., Sanders, P., Vetter, C.: Distributed Time-Dependent Contraction Hierarchies. In: Festa, P. (ed.) SEA 2010. LNCS, vol.\u00a06049, pp. 83\u201393. Springer, Heidelberg (2010)"},{"key":"4_CR20","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1038\/35022643","volume":"406","author":"J. Kleinberg","year":"2000","unstructured":"Kleinberg, J.: Navigation in a Small World. Nature\u00a0406, 845 (2000)","journal-title":"Nature"},{"key":"4_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1409060.1409097","volume":"27","author":"P.V. Sander","year":"2008","unstructured":"Sander, P.V., Nehab, D., Chlamtac, E., Hoppe, H.: Efficient Traversal of Mesh Edges Using Adjacency Primitives. ACM Trans. on Graphics\u00a027, 144:1\u2013144:9 (2008)","journal-title":"ACM Trans. on Graphics"},{"key":"4_CR22","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1038\/30918","volume":"393","author":"D. Watts","year":"1998","unstructured":"Watts, D., Strogatz, S.: Collective Dynamics of \u201cSmall-World\u201d Networks. Nature\u00a0393, 409\u2013410 (1998)","journal-title":"Nature"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2012"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33090-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:55:46Z","timestamp":1558299346000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33090-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642330896","9783642330902"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33090-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}