{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T07:11:20Z","timestamp":1775027480827,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662483497","type":"print"},{"value":"9783662483503","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-48350-3_85","type":"book-chapter","created":{"date-parts":[[2015,8,31]],"date-time":"2015-08-31T21:40:34Z","timestamp":1441057234000},"page":"1025-1036","source":"Crossref","is-referenced-by-count":17,"title":["Trip-Based Public Transit Routing"],"prefix":"10.1007","author":[{"given":"Sascha","family":"Witt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,12]]},"reference":[{"key":"85_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/978-3-642-15775-2_25","volume-title":"Algorithms \u2013 ESA 2010","author":"H. Bast","year":"2010","unstructured":"Bast, H., Carlsson, E., Eigenwillig, A., Geisberger, R., Harrelson, C., Raychev, V., Viger, F.: Fast Routing in Very Large Public Transportation Networks Using Transfer Patterns. In: de Berg, M., Meyer, U. (eds.) ESA 2010, Part I. LNCS, vol.\u00a06346, pp. 290\u2013301. Springer, Heidelberg (2010)"},{"key":"85_CR2","doi-asserted-by":"crossref","unstructured":"Bast, H., Delling, D., Goldberg, A., M\u00fcller-Hannemann, M., Pajor, T., Sanders, P., Wagner, D., Werneck, R.F.: Route Planning in Transportation Networks. ArXiv e-prints arXiv:1504.05140 [cs.DS] (Apr 2015)","DOI":"10.1007\/978-3-319-49487-6_2"},{"key":"85_CR3","doi-asserted-by":"crossref","unstructured":"Bast, H., Storandt, S.: Frequency-based Search for Public Transit. In: SIGSPATIAL, pp. 13\u201322. ACM, New York (2014)","DOI":"10.1145\/2666310.2666405"},{"key":"85_CR4","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. OASIcs (2009)"},{"key":"85_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.entcs.2003.12.019","volume":"92","author":"G.S. Brodal","year":"2004","unstructured":"Brodal, G.S., Jacob, R.: Time-dependent networks as models to achieve fast exact time-table queries. Electronic Notes in Theor. Computer Science\u00a092, 3\u201315 (2004)","journal-title":"Electronic Notes in Theor. Computer Science"},{"key":"85_CR6","unstructured":"Cionini, A., D\u2019Angelo, G., D\u2019Emidio, M., Frigioni, D., Giannakopoulou, K., Paraskevopoulos, A., Zaroliagis, C.: Engineering Graph-Based Models for Dynamic Timetable Information Systems. In: ATMOS 2014. OASIcs (2014)"},{"key":"85_CR7","unstructured":"Dean, B.C.: Continuous-Time Dynamic Shortest Path Algorithms. Master\u2019s thesis, Massachusetts Institute of Technology (1999)"},{"key":"85_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/978-3-319-20086-6_21","volume-title":"Experimental Algorithms","author":"D. Delling","year":"2015","unstructured":"Delling, D., Dibbelt, J., Pajor, T., Werneck, R.F.: Public Transit Labeling. In: Bampis, E. (ed.) SEA 2015. LNCS, vol.\u00a09125, pp. 273\u2013285. Springer, Heidelberg (2015)"},{"key":"85_CR9","doi-asserted-by":"crossref","unstructured":"Delling, D., Katz, B., Pajor, T.: Parallel Computation of Best Connections in Public Transportation Networks. JEA\u00a017, 4.4:4.1\u20134.4:4.26 (2012)","DOI":"10.1145\/2133803.2345678"},{"key":"85_CR10","doi-asserted-by":"crossref","unstructured":"Delling, D., Pajor, T., Werneck, R.F.: Round-Based Public Transit Routing. Transportation Science, advance online publication (2012)","DOI":"10.1137\/1.9781611972924.13"},{"key":"85_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-642-38527-8_6","volume-title":"Experimental Algorithms","author":"J. Dibbelt","year":"2013","unstructured":"Dibbelt, J., Pajor, T., Strasser, B., Wagner, D.: Intriguingly Simple and Fast Transit Routing. In: Bonifaci, V., Demetrescu, C., Marchetti-Spaccamela, A. (eds.) SEA 2013. LNCS, vol.\u00a07933, pp. 43\u201354. Springer, Heidelberg (2013)"},{"key":"85_CR12","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":"85_CR13","series-title":"LNEMS","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-642-48782-8_9","volume-title":"Multiple Criteria Decision Making Theory and Application","author":"P. Hansen","year":"1980","unstructured":"Hansen, P.: Bicriterion Path Problems. In: Multiple Criteria Decision Making Theory and Application. LNEMS, vol.\u00a0177, pp. 109\u2013127. Springer, Heidelberg (1980)"},{"key":"85_CR14","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)"},{"issue":"1","key":"85_CR15","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/s10479-006-0072-1","volume":"147","author":"M. M\u00fcller-Hannemann","year":"2006","unstructured":"M\u00fcller-Hannemann, M., Weihe, K.: On the cardinality of the Pareto set in bicriteria shortest path problems. Annals of Operations Research\u00a0147(1), 269\u2013286 (2006)","journal-title":"Annals of Operations Research"},{"key":"85_CR16","doi-asserted-by":"crossref","unstructured":"Pyrga, E., Schulz, F., Wagner, D., Zaroliagis, C.: Efficient Models for Timetable Information in Public Transportation Systems. JEA\u00a012, 2.4:1\u20132.4:39 (2008)","DOI":"10.1145\/1227161.1227166"},{"key":"85_CR17","doi-asserted-by":"crossref","unstructured":"Strasser, B., Wagner, D.: Connection Scan Accelerated. In: ALENEX 2014, pp. 125\u2013137 (2014)","DOI":"10.1137\/1.9781611973198.12"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2015"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48350-3_85","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T16:23:04Z","timestamp":1559233384000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48350-3_85"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662483497","9783662483503"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48350-3_85","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}