{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T05:59:04Z","timestamp":1774677544004,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642041273","type":"print"},{"value":"9783642041280","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-04128-0_53","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T14:16:36Z","timestamp":1252937796000},"page":"587-598","source":"Crossref","is-referenced-by-count":31,"title":["Accelerating Multi-modal Route Planning by Access-Nodes"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Delling","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Pajor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dorothea","family":"Wagner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"53_CR1","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A Note on Two Problems in Connexion with Graphs. Numerische Mathematik\u00a01, 269\u2013271 (1959)","journal-title":"Numerische Mathematik"},{"key":"53_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)"},{"issue":"6","key":"53_CR3","doi-asserted-by":"publisher","first-page":"1235","DOI":"10.1137\/S009753979122370X","volume":"24","author":"A.O. Mendelzon","year":"1995","unstructured":"Mendelzon, A.O., Wood, P.T.: Finding Regular Simple Paths in Graph Databases. SIAM Journal on Computing\u00a024(6), 1235\u20131258 (1995)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"53_CR4","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1137\/S0097539798337716","volume":"30","author":"C. Barrett","year":"2000","unstructured":"Barrett, C., Jacob, R., Marathe, M.V.: Formal-Language-Constrained Path Problems. SIAM Journal on Computing\u00a030(3), 809\u2013837 (2000)","journal-title":"SIAM Journal on Computing"},{"key":"53_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/3-540-45749-6_15","volume-title":"Algorithms - ESA 2002","author":"C. Barrett","year":"2002","unstructured":"Barrett, C., Bisset, K., Jacob, R., Konjevod, G., Marathe, M.V.: Classical and Contemporary Shortest Path Problems in Road Networks: Implementation and Experimental Analysis of the TRANSIMS Router. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, p. 126. Springer, Heidelberg (2002)"},{"key":"53_CR6","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":"53_CR7","volume-title":"Linear Programming and Extensions","author":"G.B. Dantzig","year":"1962","unstructured":"Dantzig, G.B.: Linear Programming and Extensions. Princeton University Press, Princeton (1962)"},{"key":"53_CR8","doi-asserted-by":"crossref","unstructured":"Barrett, C., Bisset, K., Holzer, M., Konjevod, G., Marathe, M.V., Wagner, D.: Engineering Label-Constrained Shortest-Path Algorithms. In: Shortest Paths: Ninth DIMACS Implementation Challenge. DIMACS Book. American Mathematical Society (to appear, 2009)","DOI":"10.1090\/dimacs\/074\/12"},{"issue":"5824","key":"53_CR9","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1126\/science.1137521","volume":"316","author":"H. Bast","year":"2007","unstructured":"Bast, H., Funke, S., Sanders, P., Schultes, D.: Fast Routing in Road Networks with Transit Nodes. Science\u00a0316(5824), 566 (2007)","journal-title":"Science"},{"issue":"3","key":"53_CR10","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":"53_CR11","series-title":"Annals of Mathematics Studies","first-page":"3","volume-title":"Automata Studies","author":"S.C. Kleene","year":"1956","unstructured":"Kleene, S.C.: Representation of Events in Nerve Nets and Finite Automata. In: Shannon, C.E., McCarthy, J. (eds.) Automata Studies. Annals of Mathematics Studies, pp. 3\u201342. Princeton University Press, Princeton (1956)"},{"key":"53_CR12","doi-asserted-by":"crossref","unstructured":"Rabin, M.O., Scott, D.: Finite Automata and their Decision Problems. IBM Journal of Research and Development\u00a03(1559), 114\u2013125","DOI":"10.1147\/rd.32.0114"},{"key":"53_CR13","doi-asserted-by":"crossref","unstructured":"Pyrga, E., Schulz, F., Wagner, D., Zaroliagis, C.: Efficient Models for Timetable Information in Public Transportation Systems. ACM J. of Exp. Algorithmics\u00a012, Article 2.4 (2007)","DOI":"10.1145\/1227161.1227166"},{"key":"53_CR14","unstructured":"Star Alliance (1997), http:\/\/www.staralliance.com"},{"key":"53_CR15","unstructured":"Oneworld Management Ltd. (1999), http:\/\/www.oneworld.com"},{"key":"53_CR16","unstructured":"Pajor, T.: Multi-Modal Route Planning. Master\u2019s thesis, Universit\u00e4t Karlsruhe (TH), Fakult\u00e4t f\u00fcr Informatik (2009)"},{"key":"53_CR17","unstructured":"Dean, B.C.: Continuous-Time Dynamic Shortest Path Algorithms. Master\u2019s thesis, Massachusetts Institute of Technology (1999)"},{"key":"53_CR18","doi-asserted-by":"crossref","unstructured":"Delling, D.: Time-Dependent SHARC-Routing. Algorithmica (to appear, 2009)","DOI":"10.1007\/s00453-009-9341-0"},{"key":"53_CR19","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":"53_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-540-68552-4_23","volume-title":"Experimental Algorithms","author":"R. Bauer","year":"2008","unstructured":"Bauer, R., Delling, D., Sanders, P., Schieferdecker, D., Schultes, D., Wagner, D.: Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra\u2019s Algorithm. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol.\u00a05038, pp. 303\u2013318. Springer, Heidelberg (2008)"},{"key":"53_CR21","doi-asserted-by":"crossref","unstructured":"Hilger, M., K\u00f6hler, E., M\u00f6hring, R.H., Schilling, H.: Fast Point-to-Point Shortest Path Computations with Arc-Flags. In: Shortest Paths: Ninth DIMACS Implementation Challenge. DIMACS Book. American Mathematical Society (to appear, 2009)","DOI":"10.1090\/dimacs\/074\/03"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04128-0_53","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T11:22:07Z","timestamp":1558524127000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04128-0_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642041273","9783642041280"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04128-0_53","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}