{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:10:34Z","timestamp":1725516634545},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540850960"},{"type":"electronic","value":"9783540850977"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85097-7_21","type":"book-chapter","created":{"date-parts":[[2008,8,19]],"date-time":"2008-08-19T07:18:26Z","timestamp":1219130306000},"page":"225-234","source":"Crossref","is-referenced-by-count":1,"title":["Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks"],"prefix":"10.1007","author":[{"given":"Giacomo","family":"Nannicini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philippe","family":"Baptiste","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Krob","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leo","family":"Liberti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E. Dijkstra","year":"1959","unstructured":"Dijkstra, E.: A note on two problems in connexion with graphs. Numerische Mathematik\u00a01, 269\u2013271 (1959)","journal-title":"Numerische Mathematik"},{"issue":"3","key":"21_CR2","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1287\/opre.17.3.395","volume":"17","author":"S. Dreyfus","year":"1969","unstructured":"Dreyfus, S.: An appraisal of some shortest-path algorithms. Operations Research\u00a017(3), 395\u2013412 (1969)","journal-title":"Operations Research"},{"issue":"1","key":"21_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/10248079308903779","volume":"1","author":"D.E. Kaufman","year":"1993","unstructured":"Kaufman, D.E., Smith, R.L.: Fastest paths in time-dependent networks for intelligent vehicle-highway systems application. Journal of Intelligent Transportation Systems\u00a01(1), 1\u201311 (1993)","journal-title":"Journal of Intelligent Transportation Systems"},{"issue":"3","key":"21_CR4","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":"21_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1137\/1.9781611972863.13","volume-title":"Proceedings of the 8th Workshop on Algorithm Engineering and Experiments (ALENEX 2006)","author":"A. Goldberg","year":"2006","unstructured":"Goldberg, A., Kaplan, H., Werneck, R.: Reach for A \u2009\u2217\u2009: Efficient point-to-point shortest path algorithms. In: Proceedings of the 8th Workshop on Algorithm Engineering and Experiments (ALENEX 2006). LNCS, pp. 129\u2013143. Springer, Heidelberg (2006)"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Sanders, P., Schultes, D.: Engineering fast route planning algorithms. In: [11], pp. 23\u201336","DOI":"10.1007\/978-3-540-72845-0_2"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Delling, D., Wagner, D.: Landmark-based routing in dynamic graphs. In: [11], pp. 52\u201365","DOI":"10.1007\/978-3-540-72845-0_5"},{"key":"21_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/11764298_29","volume-title":"Experimental Algorithms","author":"J. Maue","year":"2006","unstructured":"Maue, J., Sanders, P., Matijevic, D.: Goal directed shortest path queries using precomputed cluster distances. In: Alvarez, C., Serna, M.J. (eds.) WEA 2006. LNCS, vol.\u00a04007, pp. 316\u2013327. Springer, Heidelberg (2006)"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Nannicini, G., Baptiste, P., Krob, D., Liberti, L.: Fast paths in dynamic road networks. In: Quillot, A., Mahey, P. (eds.) Proceedings of ROADEF 2008, Clermont-Ferrand, Universit\u00e9 Blaise Pascal (2008)","DOI":"10.1007\/s10589-008-9172-y"},{"key":"21_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-540-70918-3_3","volume-title":"STACS 2007","author":"D. Wagner","year":"2007","unstructured":"Wagner, D., Willhalm, T.: Speed-up techniques for shortest-path computations. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol.\u00a04393, pp. 23\u201336. Springer, Heidelberg (2007)"},{"key":"21_CR11","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings of the 6th Workshop on Experimental Algorithms (WEA 2007)","year":"2007","unstructured":"Demetrescu, C. (ed.): WEA 2007. LNCS, vol.\u00a04525. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85097-7_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:21:53Z","timestamp":1606184513000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85097-7_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540850960","9783540850977"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85097-7_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}