{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:05:49Z","timestamp":1725552349516},"publisher-location":"Berlin, Heidelberg","reference-count":15,"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_4","type":"book-chapter","created":{"date-parts":[[2010,4,27]],"date-time":"2010-04-27T11:54:59Z","timestamp":1272369299000},"page":"35-46","source":"Crossref","is-referenced-by-count":10,"title":["Fully Dynamic Speed-Up Techniques for Multi-criteria Shortest Path Searches in Time-Dependent Networks"],"prefix":"10.1007","author":[{"given":"Annabell","family":"Berger","sequence":"first","affiliation":[]},{"given":"Martin","family":"Grimmer","sequence":"additional","affiliation":[]},{"given":"Matthias","family":"M\u00fcller-Hannemann","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-642-05465-5_10","volume-title":"Robust and Online Large-Scale Optimization","author":"M. M\u00fcller-Hannemann","year":"2009","unstructured":"M\u00fcller-Hannemann, M., Schnee, M.: Efficient timetable information in the presence of delays. In: Zaroliagis, C. (ed.) Robust and Online Large-Scale Optimization. LNCS, vol.\u00a05868, pp. 249\u2013272. Springer, Heidelberg (2009)"},{"key":"4_CR2","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":"4_CR3","doi-asserted-by":"crossref","first-page":"782","DOI":"10.1137\/1.9781611973075.64","volume-title":"SODA 2010: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms","author":"I. Abraham","year":"2010","unstructured":"Abraham, I., Fiat, A., Goldberg, A.V., Werneck, R.F.: Highway dimension, shortest paths, and provably efficient algorithms. In: SODA 2010: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 782\u2013793. SIAM, Philadelphia (2010)"},{"key":"4_CR4","unstructured":"Berger, A., Delling, D., Gebhardt, A., M\u00fcller-Hannemann, M.: Accelerating time-dependent multi-criteria timetable information is harder than expected. In: Clausen, J., Stefano, G.D. (eds.) ATMOS 2009 - 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems, Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Germany (2009)"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Bauer, R., Delling, D., Wagner, D.: Experimental study on speed-up techniques for timetable information systems. Networks (to appear, 2010)","DOI":"10.1002\/net.20382"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/978-3-642-03456-5_24","volume-title":"Efficient Algorithms","author":"H. Bast","year":"2009","unstructured":"Bast, H.: Car or public transport\u2014two worlds. In: Albers, S., Alt, H., N\u00e4her, S. (eds.) Efficient Algorithms: Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday. LNCS, vol.\u00a05760, pp. 355\u2013367. Springer, Heidelberg (2009)"},{"key":"4_CR7","unstructured":"Berger, A., M\u00fcller-Hannemann, M.: Subpath-optimality of multi-criteria shortest paths in time-dependent and event-dependent networks. Technical report, Martin-Luther-Universit\u00e4t Halle-Wittenberg, Department of Computer Science (2009)"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.entcs.2003.12.023","volume":"92","author":"D. Wagner","year":"2004","unstructured":"Wagner, D., Willhalm, T., Zaroliagis, C.D.: Dynamic shortest paths containers. Electr. Notes Theor. Comput. Sci.\u00a092, 65\u201384 (2004)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-540-72845-0_6","volume-title":"Experimental Algorithms","author":"D. Schultes","year":"2007","unstructured":"Schultes, D., Sanders, P.: Dynamic highway-node routing. In: Demetrescu, C. (ed.) WEA 2007. LNCS, vol.\u00a04525, pp. 66\u201379. Springer, Heidelberg (2007)"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-540-72845-0_5","volume-title":"Experimental Algorithms","author":"D. Delling","year":"2007","unstructured":"Delling, D., Wagner, D.: Landmark-based routing in dynamic graphs. In: Demetrescu, C. (ed.) WEA 2007. LNCS, vol.\u00a04525, pp. 52\u201365. Springer, Heidelberg (2007)"},{"key":"4_CR11","unstructured":"Berrettini, E., D\u2019Angelo, G., Delling, D.: Arc-flags in dynamic graphs. In: Clausen, J., Stefano, G.D. (eds.) ATMOS 2009 - 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems, Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Germany (2009)"},{"key":"4_CR12","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":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/978-3-540-85097-7_21","volume-title":"Combinatorial Optimization and Applications","author":"G. Nannicini","year":"2008","unstructured":"Nannicini, G., Baptiste, P., Krob, D., Liberti, L.: Fast computation of point-to-point paths on time-dependent road networks. In: Yang, B., Du, D.-Z., Wang, C.A. (eds.) COCOA 2008. LNCS, vol.\u00a05165, pp. 225\u2013234. Springer, Heidelberg (2008)"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Nannicini, G., Baptiste, P., Barbier, G., Krob, D., Liberti, L.: Fast paths in large-scale dynamic road networks. Computational Optimization and Applications (published online, 2008)","DOI":"10.1007\/s10589-008-9172-y"},{"key":"4_CR15","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. J. ACM\u00a037, 607\u2013625 (1990)","journal-title":"J. ACM"}],"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_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:02:39Z","timestamp":1606186959000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13193-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642131929","9783642131936"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13193-6_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}