{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T18:33:06Z","timestamp":1772908386374,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642157745","type":"print"},{"value":"9783642157752","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15775-2_25","type":"book-chapter","created":{"date-parts":[[2010,9,1]],"date-time":"2010-09-01T10:47:32Z","timestamp":1283338052000},"page":"290-301","source":"Crossref","is-referenced-by-count":52,"title":["Fast Routing in Very Large Public Transportation Networks Using Transfer Patterns"],"prefix":"10.1007","author":[{"given":"Hannah","family":"Bast","sequence":"first","affiliation":[]},{"given":"Erik","family":"Carlsson","sequence":"additional","affiliation":[]},{"given":"Arno","family":"Eigenwillig","sequence":"additional","affiliation":[]},{"given":"Robert","family":"Geisberger","sequence":"additional","affiliation":[]},{"given":"Chris","family":"Harrelson","sequence":"additional","affiliation":[]},{"given":"Veselin","family":"Raychev","sequence":"additional","affiliation":[]},{"given":"Fabien","family":"Viger","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","unstructured":"Extended version of this paper, http:\/\/ad.informatik.uni-freiburg.de\/papers"},{"key":"25_CR2","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":"25_CR3","unstructured":"Berger, A., Delling, D., Gebhardt, A., M\u00fcller-Hannemann, M.: Accelerating time-dependent multi-criteria timetable information is harder than expected. In: ATMOS 2009. Dagstuhl Seminar Proceedings (2009)"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"Delling, D.: Time-dependent SHARC-routing. In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol.\u00a05193, pp. 332\u2013343. Springer, Heidelberg (2008)","DOI":"10.1007\/978-3-540-87744-8_28"},{"key":"25_CR5","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":"25_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/978-3-540-68552-4_26","volume-title":"Experimental Algorithms","author":"Y. Disser","year":"2008","unstructured":"Disser, Y., M\u00fcller-Hannemann, M., Schnee, M.: Multi-criteria shortest paths in time-dependent train networks. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol.\u00a05038, pp. 347\u2013361. Springer, Heidelberg (2008)"},{"key":"25_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-642-13193-6_7","volume-title":"Experimental Algorithms","author":"R. Geisberger","year":"2010","unstructured":"Geisberger, R.: Contraction of timetable networks with realistic transfers. In: Festa, P. (ed.) SEA 2010. LNCS, vol.\u00a06049, pp. 71\u201382. Springer, Heidelberg (2010)"},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"670","DOI":"10.1145\/358172.358406","volume":"26","author":"R.P. Loui","year":"1983","unstructured":"Loui, R.P.: Optimal paths in graphs with stochastic or multidimensional weights. Commun. ACM\u00a026, 670\u2013676 (1983)","journal-title":"Commun. ACM"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"M\u00f6hring, R.H.: Verteilte Verbindungssuche im \u00f6ffentlichen Personenverkehr: Graphentheoretische Modelle und Algorithmen. In: Horster, P. (ed.) Angewandte Mathematik \u2013 insbesondere Informatik, pp. 192\u2013220. Vieweg (1999)","DOI":"10.1007\/978-3-322-83092-0_11"},{"key":"25_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-540-74247-0_3","volume-title":"Algorithmic Methods for Railway Optimization","author":"M. M\u00fcller-Hannemann","year":"2007","unstructured":"M\u00fcller-Hannemann, M., Schulz, F., Wagner, D., Zaroliagis, C.: Timetable information: Models and algorithms. In: Geraets, F., Kroon, L.G., Schoebel, A., Wagner, D., Zaroliagis, C.D. (eds.) Railway Optimization 2004. LNCS, vol.\u00a04359, pp. 67\u201390. Springer, Heidelberg (2007)"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Pyrga, E., Schulz, F., Wagner, D., Zaroliagis, C.D.: Efficient models for timetable information in public transportation systems. J. Exp. Algorithmics\u00a012 (2007)","DOI":"10.1145\/1227161.1227166"},{"key":"25_CR12","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":"25_CR13","unstructured":"Theune, D.: Robuste und effiziente Methoden zur L\u00f6sung von Wegproblemen. Teubner (1995)"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15775-2_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T20:18:07Z","timestamp":1559506687000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15775-2_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642157745","9783642157752"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15775-2_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}