{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T09:20:00Z","timestamp":1742635200802},"publisher-location":"Berlin, Heidelberg","reference-count":24,"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_7","type":"book-chapter","created":{"date-parts":[[2010,4,27]],"date-time":"2010-04-27T11:54:59Z","timestamp":1272369299000},"page":"71-82","source":"Crossref","is-referenced-by-count":22,"title":["Contraction of Timetable Networks with Realistic Transfers"],"prefix":"10.1007","author":[{"given":"Robert","family":"Geisberger","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"7_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":"7_CR2","doi-asserted-by":"crossref","unstructured":"Geisberger, R., Sanders, P., Schultes, D., Delling, D.: Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks. In: [22], pp. 319\u2013333","DOI":"10.1007\/978-3-540-68552-4_24"},{"key":"7_CR3","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":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/3-540-44688-5_15","volume-title":"Algorithm Engineering","author":"M. M\u00fcller-Hannemann","year":"2001","unstructured":"M\u00fcller-Hannemann, M., Weihe, K.: Pareto Shortest Paths is Often Feasible in Practice. In: Brodal, G.S., Frigioni, D., Marchetti-Spaccamela, A. (eds.) WAE 2001. LNCS, vol.\u00a02141, pp. 185\u2013197. Springer, Heidelberg (2001)"},{"volume-title":"Equilibrium and Advanced Transportation Modelling","year":"1998","key":"7_CR5","unstructured":"Marcotte, P., Nguyen, S. (eds.): Equilibrium and Advanced Transportation Modelling. Kluwer Academic Publishers Group, Dordrecht (1998)"},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1145\/351827.384254","volume":"5","author":"F. Schulz","year":"2000","unstructured":"Schulz, F., Wagner, D., Weihe, K.: Dijkstra\u2019s Algorithm On-Line: An Empirical Case Study from Public Railroad Transport. ACM Journal of Experimental Algorithmics\u00a05, 12 (2000)","journal-title":"ACM Journal of Experimental Algorithmics"},{"key":"7_CR7","unstructured":"Brodal, G., Jacob, R.: Time-dependent Networks as Models to Achieve Fast Exact Time-table Queries. In: [23], pp. 3\u201315"},{"issue":"1","key":"7_CR8","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/0377-2217(94)E0349-G","volume":"83","author":"K. Nachtigall","year":"1995","unstructured":"Nachtigall, K.: Time depending shortest-path problems with applications to railway networks. European Journal of Operational Research\u00a083(1), 154\u2013166 (1995)","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"7_CR9","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":"7_CR10","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1002\/net.3230210304","volume":"21","author":"A. Orda","year":"1991","unstructured":"Orda, A., Rom, R.: Minimum Weight Paths in Time-Dependent Networks. Networks\u00a021, 295\u2013319 (1991)","journal-title":"Networks"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Pyrga, E., Schulz, F., Wagner, D., Zaroliagis, C.: Efficient Models for Timetable Information in Public Transportation Systems. ACM Journal of Experimental Algorithmics\u00a012, Article 2.4 (2007)","DOI":"10.1145\/1227161.1227166"},{"key":"7_CR12","unstructured":"Berger, A., M\u00fcller\u2013Hannemann, M.: Subpath-Optimality of Multi-Criteria Shortest Paths in Time-and Event-Dependent Networks. Technical Report\u00a01, University Halle-Wittenberg, Institute of Computer Science (2009)"},{"key":"7_CR13","unstructured":"Berger, A., Delling, D., Gebhardt, A., M\u00fcller\u2013Hannemann, M.: Accelerating Time-Dependent Multi-Criteria Timetable Information is Harder Than Expected. In: Proceedings of the 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS 2009), Dagstuhl Seminar Proceedings (2009)"},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-642-05465-5_8","volume-title":"Robust and Online Large-Scale Optimization","author":"D. Delling","year":"2009","unstructured":"Delling, D., Wagner, D.: Time-Dependent Route Planning. In: Ahuja, R.K., M\u00f6hring, R.H., Zaroliagis, C. (eds.) Robust and Online Large-Scale Optimization. LNCS, vol.\u00a05868, pp. 207\u2013230. Springer, Heidelberg (2009)"},{"key":"7_CR15","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 \u2013 Two Worlds. In: Albers, S., Alt, H., N\u00e4her, S. (eds.) Efficient Algorithms. LNCS, vol.\u00a05760, pp. 355\u2013367. Springer, Heidelberg (2009)"},{"key":"7_CR16","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"P.E. Hart","year":"1968","unstructured":"Hart, P.E., Nilsson, N., Raphael, B.: A Formal Basis for the Heuristic Determination of Minimum Cost Paths. IEEE Transactions on Systems Science and Cybernetics\u00a04, 100\u2013107 (1968)","journal-title":"IEEE Transactions on Systems Science and Cybernetics"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Pyrga, E., Schulz, F., Wagner, D., Zaroliagis, C.: Towards Realistic Modeling of Time-Table Information through the Time-Dependent Approach. In: [22], pp. 85\u2013103","DOI":"10.1016\/j.entcs.2003.12.024"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Disser, Y., M\u00fcller\u2013Hannemann, M., Schnee, M.: Multi-Criteria Shortest Paths in Time-Dependent Train Networks. In: [22], pp. 347\u2013361","DOI":"10.1007\/978-3-540-68552-4_26"},{"key":"#cr-split#-7_CR19.1","doi-asserted-by":"crossref","unstructured":"Delling, D.: Time-Dependent SHARC-Routing. Algorithmica (July 2009);","DOI":"10.1007\/s00453-009-9341-0"},{"key":"#cr-split#-7_CR19.2","unstructured":"In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol.??5193, pp. 332???343. Springer, Heidelberg (2008)"},{"key":"7_CR20","unstructured":"Vetter, C.: Parallel Time-Dependent Contraction Hierarchies (2009), Student Research Project, http:\/\/algo2.iti.kit.edu\/documents\/routeplanning\/vetter_sa.pdf"},{"key":"7_CR21","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":"7_CR22","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)"},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"Proceedings of the 3rd Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS 2003). Electronic Notes in Theoretical Computer Science, vol. 92 (2004)","DOI":"10.1016\/j.entcs.2003.12.019"}],"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_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:02:41Z","timestamp":1606186961000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13193-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642131929","9783642131936"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13193-6_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}