{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:00:09Z","timestamp":1740099609609,"version":"3.37.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030340285"},{"type":"electronic","value":"9783030340292"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-34029-2_16","type":"book-chapter","created":{"date-parts":[[2019,11,14]],"date-time":"2019-11-14T03:02:40Z","timestamp":1573700560000},"page":"237-247","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Fast Public Transit Routing with Unrestricted Walking Through Hub Labeling"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4199-3101","authenticated-orcid":false,"given":"Duc-Minh","family":"Phan","sequence":"first","affiliation":[]},{"given":"Laurent","family":"Viennot","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,14]]},"reference":[{"key":"16_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/978-3-642-20662-7_20","volume-title":"Experimental Algorithms","author":"I Abraham","year":"2011","unstructured":"Abraham, I., Delling, D., Goldberg, A.V., Werneck, R.F.: A hub-based labeling algorithm for shortest paths in road networks. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol. 6630, pp. 230\u2013241. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20662-7_20"},{"key":"16_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-642-33090-2_4","volume-title":"Algorithms \u2013 ESA 2012","author":"I Abraham","year":"2012","unstructured":"Abraham, I., Delling, D., Goldberg, A.V., Werneck, R.F.: Hierarchical hub labelings for shortest paths. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol. 7501, pp. 24\u201335. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33090-2_4"},{"key":"16_CR3","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., et al.: Fast routing in very large public transportation networks using transfer patterns. In: de Berg, M., Meyer, U. (eds.) ESA 2010. LNCS, vol. 6346, pp. 290\u2013301. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15775-2_25"},{"key":"16_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-319-49487-6_2","volume-title":"Algorithm Engineering","author":"H Bast","year":"2016","unstructured":"Bast, H., et al.: Route planning in transportation networks. In: Kliemann, L., Sanders, P. (eds.) Algorithm Engineering. LNCS, vol. 9220, pp. 19\u201380. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-49487-6_2"},{"key":"16_CR5","doi-asserted-by":"publisher","unstructured":"Bast, H., Hertel, M., Storandt, S.: Scalable transfer patterns. In: Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments, ALENEX 2016, pp. 15\u201329. SIAM (2016). https:\/\/doi.org\/10.1137\/1.9781611974317.2","DOI":"10.1137\/1.9781611974317.2"},{"issue":"5","key":"16_CR6","doi-asserted-by":"publisher","first-page":"1338","DOI":"10.1137\/S0097539702403098","volume":"32","author":"E Cohen","year":"2003","unstructured":"Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and distance queries via 2-hop labels. SIAM J. Comput. 32(5), 1338\u20131355 (2003). https:\/\/doi.org\/10.1137\/S0097539702403098","journal-title":"SIAM J. Comput."},{"key":"16_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-642-38527-8_24","volume-title":"Experimental Algorithms","author":"D Delling","year":"2013","unstructured":"Delling, D., Dibbelt, J., Pajor, T., Wagner, D., Werneck, R.F.: Computing multimodal journeys in practice. In: Bonifaci, V., Demetrescu, C., Marchetti-Spaccamela, A. (eds.) SEA 2013. LNCS, vol. 7933, pp. 260\u2013271. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38527-8_24"},{"key":"16_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. 9125, pp. 273\u2013285. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-20086-6_21"},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-3-662-44777-2_27","volume-title":"Algorithms - ESA 2014","author":"D Delling","year":"2014","unstructured":"Delling, D., Goldberg, A.V., Pajor, T., Werneck, R.F.: Robust distance queries on massive networks. In: Schulz, A.S., Wagner, D. (eds.) ESA 2014. LNCS, vol. 8737, pp. 321\u2013333. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44777-2_27"},{"key":"16_CR10","doi-asserted-by":"publisher","first-page":"932","DOI":"10.1007\/978-1-4939-2864-4_580","volume-title":"Encyclopedia of Algorithms","author":"D Delling","year":"2016","unstructured":"Delling, D., Goldberg, A.V., Werneck, R.F.: Hub labeling (2-hop labeling). In: Kao, M.Y. (ed.) Encyclopedia of Algorithms, pp. 932\u2013938. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-1-4939-2864-4_580"},{"issue":"3","key":"16_CR11","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1287\/trsc.2014.0534","volume":"49","author":"D Delling","year":"2015","unstructured":"Delling, D., Pajor, T., Werneck, R.F.: Round-based public transit routing. Transp. Sci. 49(3), 591\u2013604 (2015). https:\/\/doi.org\/10.1287\/trsc.2014.0534","journal-title":"Transp. Sci."},{"key":"16_CR12","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/3274661","volume":"23","author":"J Dibbelt","year":"2018","unstructured":"Dibbelt, J., Pajor, T., Strasser, B., Wagner, D.: Connection scan algorithm. ACM J. Exp. Algorithmics 23, 17 (2018). https:\/\/dl.acm.org\/citation.cfm?id=3274661","journal-title":"ACM J. Exp. Algorithmics"},{"key":"16_CR13","doi-asserted-by":"publisher","first-page":"1.1-1.19","DOI":"10.1145\/2699886","volume":"19","author":"Julian Dibbelt","year":"2015","unstructured":"Dibbelt, J., Pajor, T., Wagner, D.: User-constrained multimodal route planning. ACM J. Exp. Algorithmics 19(1), (2014). https:\/\/doi.org\/10.1145\/2699886","journal-title":"Journal of Experimental Algorithmics"},{"issue":"3","key":"16_CR14","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1287\/trsc.1110.0401","volume":"46","author":"R Geisberger","year":"2012","unstructured":"Geisberger, R., Sanders, P., Schultes, D., Vetter, C.: Exact routing in large road networks using contraction hierarchies. Transp. Sci. 46(3), 388\u2013404 (2012). https:\/\/doi.org\/10.1287\/trsc.1110.0401","journal-title":"Transp. Sci."},{"key":"16_CR15","unstructured":"Geofabrik. http:\/\/download.geofabrik.de\/"},{"key":"16_CR16","unstructured":"Open Data RATP. https:\/\/data.ratp.fr\/"},{"key":"16_CR17","unstructured":"OpenStreetMap. https:\/\/www.openstreetmap.org\/"},{"key":"16_CR18","unstructured":"Transport for London Unified API. https:\/\/api.tfl.gov.uk\/"},{"key":"16_CR19","doi-asserted-by":"publisher","unstructured":"Wagner, D., Z\u00fcndorf, T.: Public transit routing with unrestricted walking. In: 17th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS OASICS, vol. 59, pp. 7:1\u20137:14 (2017). https:\/\/doi.org\/10.4230\/OASIcs.ATMOS.2017.7","DOI":"10.4230\/OASIcs.ATMOS.2017.7"},{"key":"16_CR20","doi-asserted-by":"publisher","unstructured":"Wang, S., Lin, W., Yang, Y., Xiao, X., Zhou, S.: Efficient route planning on public transportation networks: A labelling approach. In: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, SIGMOD 2015, pp. 967\u2013982. ACM, New York (2015). https:\/\/doi.org\/10.1145\/2723372.2749456","DOI":"10.1145\/2723372.2749456"}],"container-title":["Lecture Notes in Computer Science","Analysis of Experimental Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-34029-2_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,3]],"date-time":"2021-02-03T04:18:32Z","timestamp":1612325912000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-34029-2_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030340285","9783030340292"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-34029-2_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"14 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SEA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Experimental Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kalamata","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wea2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.caopt.com\/SEA2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"45","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"78% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}