{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T14:22:23Z","timestamp":1769264543448,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642131929","type":"print"},{"value":"9783642131936","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13193-6_15","type":"book-chapter","created":{"date-parts":[[2010,4,27]],"date-time":"2010-04-27T11:54:59Z","timestamp":1272369299000},"page":"166-177","source":"Crossref","is-referenced-by-count":30,"title":["Time-Dependent Contraction Hierarchies and Approximation"],"prefix":"10.1007","author":[{"given":"Gernot Veit","family":"Batz","sequence":"first","affiliation":[]},{"given":"Robert","family":"Geisberger","sequence":"additional","affiliation":[]},{"given":"Sabine","family":"Neubauer","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Sanders","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","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":"15_CR2","volume-title":"ALENEX 2009","author":"G.V. Batz","year":"2009","unstructured":"Batz, G.V., Delling, D., Sanders, P., Vetter, C.: Time-Dependent Contraction Hierarchies. In: Finocchi, I., Hershberger, J. (eds.) ALENEX 2009. SIAM, Philadelphia (2009)"},{"key":"15_CR3","unstructured":"Vetter, C.: Parallel Time-Dependent Contraction Hierarchies (2009), Student Research Project, http:\/\/algo2.iti.kit.edu\/download\/vetter_sa.pdf"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Geisberger, R., Sanders, P., Schultes, D., Delling, D.: Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks. In: [12], pp. 319\u2013333","DOI":"10.1007\/978-3-540-68552-4_24"},{"issue":"3","key":"15_CR5","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1145\/79147.214078","volume":"37","author":"A. Orda","year":"1990","unstructured":"Orda, A., Rom, R.: Shortest-Path and Minimum Delay Algorithms in Networks with Time-Dependent Edge-Length. Journal of the ACM\u00a037(3), 607\u2013625 (1990)","journal-title":"Journal of the ACM"},{"key":"15_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":"#cr-split#-15_CR7.1","doi-asserted-by":"crossref","unstructured":"Delling, D.: Time-Dependent SHARC-Routing. Algorithmica (2009);","DOI":"10.1007\/s00453-009-9341-0"},{"key":"#cr-split#-15_CR7.2","unstructured":"In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol.??5193, pp. 332???343. Springer, Heidelberg (2008)"},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/978-3-642-13193-6_5","volume-title":"SEA 2010","author":"E. Brunel","year":"2010","unstructured":"Brunel, E., Delling, D., Gemsa, A., Wagner, D.: Space-Efficient SHARC-Routing. In: Festa, P. (ed.) SEA 2010. LNCS, vol.\u00a06049, pp. 47\u201358. Springer, Heidelberg (2010)"},{"key":"15_CR9","unstructured":"Neubauer, S.: Space Efficient Approximation of Piecewise Linear Functions (2009), Student Research Project, http:\/\/algo2.iti.kit.edu\/download\/neuba_sa.pdf"},{"issue":"3","key":"15_CR10","first-page":"159","volume":"9","author":"H. Imai","year":"1987","unstructured":"Imai, H., Iri, M.: An optimal algorithm for approximating a piecewise linear function. Journal of Information Processing\u00a09(3), 159\u2013162 (1987)","journal-title":"Journal of Information Processing"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Nannicini, G., Delling, D., Liberti, L., Schultes, D.: Bidirectional A* Search for Time-Dependent Fast Paths. In: [12], pp. 334\u2013346","DOI":"10.1007\/978-3-540-68552-4_25"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","volume-title":"Experimental Algorithms","year":"2008","unstructured":"McGeoch, C.C. (ed.): WEA 2008. LNCS, vol.\u00a05038. Springer, Heidelberg (2008)"}],"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_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:02:32Z","timestamp":1606186952000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13193-6_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642131929","9783642131936"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13193-6_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}