{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T07:58:23Z","timestamp":1761292703631},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642131929"},{"type":"electronic","value":"9783642131936"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13193-6_8","type":"book-chapter","created":{"date-parts":[[2010,4,27]],"date-time":"2010-04-27T11:54:59Z","timestamp":1272369299000},"page":"83-93","source":"Crossref","is-referenced-by-count":28,"title":["Distributed Time-Dependent Contraction Hierarchies"],"prefix":"10.1007","author":[{"given":"Tim","family":"Kieritz","sequence":"first","affiliation":[]},{"given":"Dennis","family":"Luxen","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Sanders","sequence":"additional","affiliation":[]},{"given":"Christian","family":"Vetter","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1137\/1.9781611972894.10","volume-title":"Proceedings of the 11th Workshop on Algorithm Engineering and Experiments (ALENEX 2009)","author":"G.V. Batz","year":"2009","unstructured":"Batz, G.V., Delling, D., Sanders, P., Vetter, C.: Time-Dependent Contraction Hierarchies. In: Proceedings of the 11th Workshop on Algorithm Engineering and Experiments (ALENEX 2009), pp. 97\u2013105. SIAM, Philadelphia (2009)"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1007\/978-3-642-13193-6_15","volume-title":"SEA 2010","author":"G.V. Batz","year":"2010","unstructured":"Batz, G.V., Geisberger, R., Neubauer, S., Sanders, P.: Time-dependent contraction hierarchies and approximation. In: Festa, P. (ed.) SEA 2010. LNCS, vol.\u00a06049, pp. 166\u2013177. Springer, Heidelberg (2010)"},{"key":"8_CR3","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1137\/1.9781611972887.2","volume-title":"Proceedings of the 10th Workshop on Algorithm Engineering and Experiments (ALENEX 2008)","author":"R. Bauer","year":"2008","unstructured":"Bauer, R., Delling, D.: SHARC: Fast and Robust Unidirectional Routing. In: Proceedings of the 10th Workshop on Algorithm Engineering and Experiments (ALENEX 2008), pp. 13\u201326. SIAM, Philadelphia (2008)"},{"key":"8_CR4","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. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol.\u00a05038, pp. 303\u2013318. Springer, Heidelberg (2008)"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/978-3-540-87744-8_28","volume-title":"Algorithms - ESA 2008","author":"D. Delling","year":"2008","unstructured":"Delling, D.: Time-dependent SHARC-routing. In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol.\u00a05193, pp. 332\u2013343. Springer, Heidelberg (2008)"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"812","DOI":"10.1007\/978-3-540-92182-0_71","volume-title":"Algorithms and Computation","author":"D. Delling","year":"2008","unstructured":"Delling, D., Nannicini, G.: Bidirectional Core-Based Routing in Dynamic Time-Dependent Road Networks. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol.\u00a05369, pp. 812\u2013823. Springer, Heidelberg (2008)"},{"key":"8_CR7","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":"8_CR8","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":"8_CR9","unstructured":"Pellegrini, F.: SCOTCH: Static Mapping, Graph, Mesh and Hypergraph Partitioning, and Parallel and Sequential Sparse Matrix Ordering Package (2007)"},{"key":"8_CR10","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":"8_CR11","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)"},{"key":"8_CR12","unstructured":"Vetter, C.: Parallel time-dependent contraction hierarchies. Student Research Project, Universit\u00e4t Karlsruhe (TH) (2009), \n                    \n                      http:\/\/algo2.iti.kit.edu\/1588.php"},{"key":"8_CR13","unstructured":"Volker, L.: Route planning in road networks with turn costs. Student Research Project, Universit\u00e4t Karlsruhe (TH) (2008), \n                    \n                      http:\/\/algo2.iti.kit.edu\/1154.php"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13193-6_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:57:20Z","timestamp":1619783840000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13193-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642131929","9783642131936"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13193-6_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}