{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T05:12:57Z","timestamp":1768108377462,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642385261","type":"print"},{"value":"9783642385278","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38527-8_7","type":"book-chapter","created":{"date-parts":[[2013,5,8]],"date-time":"2013-05-08T09:23:02Z","timestamp":1368004982000},"page":"55-66","source":"Crossref","is-referenced-by-count":34,"title":["Transit Node Routing Reconsidered"],"prefix":"10.1007","author":[{"given":"Julian","family":"Arz","sequence":"first","affiliation":[]},{"given":"Dennis","family":"Luxen","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Sanders","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","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)"},{"issue":"3","key":"7_CR2","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 Science\u00a046(3), 388\u2013404 (2012)","journal-title":"Transportation Science"},{"issue":"5824","key":"7_CR3","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"},{"key":"7_CR4","unstructured":"Bast, H., Funke, S., Matijevic, D.: TRANSIT - Ultrafast Shortest-Path Queries with Linear-Time Preprocessing. In: Demetrescu, C., Goldberg, A.V., Johnson, D.S. (eds.) 9th DIMACS Implementation Challenge \u2013 Shortest Paths (2006)"},{"key":"7_CR5","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: Proceedings of the 9th Workshop on Algorithm Engineering and Experiments, ALENEX 2007, pp. 46\u201359. SIAM (2007)","DOI":"10.1137\/1.9781611972870.5"},{"key":"7_CR6","unstructured":"Geisberger, R.: Contraction Hierarchies. Master\u2019s thesis, Universit\u00e4t Karlsruhe (2008), \n                    \n                      http:\/\/algo2.iti.kit.edu\/1094.php"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Schultes, D.: Route Planning in Road Networks. PhD thesis, Universit\u00e4t Karlsruhe (February 2008), \n                    \n                      http:\/\/algo2.iti.uka.de\/schultes\/hwy\/schultes_diss.pdf","DOI":"10.1007\/978-0-387-30162-4_353"},{"key":"7_CR8","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. LNCS, vol.\u00a05515, pp. 117\u2013139. Springer, Heidelberg (2009)"},{"issue":"1","key":"7_CR9","first-page":"1","volume":"17","author":"P. Sanders","year":"2012","unstructured":"Sanders, P., Schultes, D.: Engineering Highway Hierarchies. ACM Journal of Experimental Algorithmics\u00a017(1), 1\u201340 (2012)","journal-title":"ACM Journal of Experimental Algorithmics"},{"key":"7_CR10","unstructured":"Bast, H.: Lecture slides: Efficient route planning, \n                    \n                      http:\/\/ad-wiki.informatik.uni-freiburg.de\/teaching\/EfficientRoutePlanningSS2012"},{"key":"7_CR11","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":"7_CR12","unstructured":"Delling, D., Goldberg, A.V., Werneck, R.F.: Faster Batched Shortest Paths in Road Networks. In: 11th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems. OpenAccess Series in Informatics (OASIcs), vol.\u00a020, pp. 52\u201363 (2011)"},{"key":"7_CR13","unstructured":"Vetter, C.: Fast and Exact Mobile Navigation with OpenStreetMap Data. Master\u2019s thesis, Karlsruhe Institute of Technology (2010)"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Knopp, S., Sanders, P., Schultes, D., Schulz, F., Wagner, D.: Computing Many-to-Many Shortest Paths Using Highway Hierarchies. In: 9th Workshop on Algorithm Engineering and Experiments, pp. 36\u201345. SIAM (2007)","DOI":"10.1137\/1.9781611972870.4"},{"issue":"3","key":"7_CR15","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0020-0190(88)90066-X","volume":"27","author":"K. Mehlhorn","year":"1988","unstructured":"Mehlhorn, K.: A faster approximation algorithm for the Steiner problem in graphs. Information Processing Letters\u00a027(3), 125\u2013128 (1988)","journal-title":"Information Processing Letters"},{"key":"7_CR16","unstructured":"Vetter, C.: Parallel Time-Dependent Contraction Hierarchies. Studienarbeit, Karlsruhe Institute of Technology (2009), \n                    \n                      http:\/\/algo2.iti.kit.edu\/download\/vetter_sa.pdf"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Demetrescu, C., Goldberg, A.V., Johnson, D.S. (eds.): The Shortest Path Problem: Ninth DIMACS Implementation Challenge. DIMACS Book, vol.\u00a074. American Mathematical Society (2009)","DOI":"10.1090\/dimacs\/074"},{"key":"7_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-540-68552-4_23","volume-title":"Experimental Algorithms","author":"R. Bauer","year":"2008","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 Journal of Experimental Algorithmics 15(2.3), 1\u201331 (2010), Special Section devoted to In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol.\u00a05038, pp. 303\u2013318. Springer, Heidelberg (2008)"},{"key":"7_CR19","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":"7_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/978-3-642-38541-4","volume-title":"SEA 2013","author":"D. Delling","year":"2013","unstructured":"Delling, D., Goldberg, A.V., Werneck, R.F.: Hub Label Compression. In: Bonifaci, V. (ed.) SEA 2013. LNCS, vol.\u00a07933, pp. 17\u201328. Springer, Heidelberg (2013)"},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"Eisner, J., Funke, S.: Transit Nodes \u2013 Lower Bounds and Refined Construction. In: Proceedings of the 14th Meeting on Algorithm Engineering and Experiments, ALENEX 2012, pp. 141\u2013149. SIAM (2012)","DOI":"10.1137\/1.9781611972924.14"},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"Delling, D., Goldberg, A.V., Nowatzyk, A., Werneck, R.F.: PHAST: Hardware-Accelerated Shortest Path Trees. In: 25th International Parallel and Distributed Processing Symposium, IPDPS 2011 (2011)","DOI":"10.1109\/IPDPS.2011.89"},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"Arz, J., Luxen, D., Sanders, P.: Transit Node Routing Reconsidered. Technical report, Karlsruhe Institute of Technology (2012)","DOI":"10.1007\/978-3-642-38527-8_7"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38527-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T19:30:32Z","timestamp":1557689432000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38527-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642385261","9783642385278"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38527-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}