{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T02:48:35Z","timestamp":1783133315830,"version":"3.54.6"},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540388753","type":"print"},{"value":"9783540388760","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11841036_71","type":"book-chapter","created":{"date-parts":[[2006,9,11]],"date-time":"2006-09-11T09:20:54Z","timestamp":1157966454000},"page":"804-816","source":"Crossref","is-referenced-by-count":82,"title":["Engineering Highway Hierarchies"],"prefix":"10.1007","author":[{"given":"Peter","family":"Sanders","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dominik","family":"Schultes","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"71_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1007\/11561071_51","volume-title":"Algorithms \u2013 ESA 2005","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":"71_CR2","unstructured":"Goldberg, A.V., Harrelson, C.: Computing the shortest path: A\n                           * meets graph theory. In: 16th ACM-SIAM Symposium on Discrete Algorithms, pp. 156\u2013165 (2005)"},{"key":"71_CR3","unstructured":"Willhalm, T.: Engineering Shortest Path and Layout Algorithms for Large Graphs. PhD thesis, Universit\u00e4t Karlsruhe (TH), Fakult\u00e4t f\u00fcr Informatik (2005)"},{"key":"71_CR4","unstructured":"Schultes, D.: Fast and exact shortest path queries using highway hierarchies. Master\u2019s thesis, Universit\u00e4t des Saarlandes (2005)"},{"key":"71_CR5","unstructured":"Gutman, R.: Reach-based routing: A new approach to shortest path algorithms optimized for road networks. In: 6th Workshop on Algorithm Engineering and Experiments (2004)"},{"key":"71_CR6","doi-asserted-by":"crossref","unstructured":"Goldberg, A., Kaplan, H., Werneck, R.: Reach for A\n                           *: Efficient point-to-point shortest path algorithms. In: Workshop on Algorithm Engineering & Experiments (2006)","DOI":"10.1137\/1.9781611972863.13"},{"key":"71_CR7","unstructured":"UA Census 2000 TIGER\/Line Files, U.S.\u00a0Census Bureau, Washington, DC (2002), \n                    \n                      http:\/\/www.census.gov\/geo\/www\/tiger\/tigerua\/ua_tgr2k.html"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11841036_71.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:17:00Z","timestamp":1619493420000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11841036_71"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540388753","9783540388760"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/11841036_71","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}