{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:46:09Z","timestamp":1767314769287,"version":"3.48.0"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032118349","type":"print"},{"value":"9783032118356","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-11835-6_3","type":"book-chapter","created":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:43:37Z","timestamp":1767314617000},"page":"33-47","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Canadian Traveler Problems in\u00a0Temporal Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-5424-0742","authenticated-orcid":false,"given":"Thomas","family":"Bellitto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9548-5260","authenticated-orcid":false,"given":"Johanne","family":"Cohen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6477-8706","authenticated-orcid":false,"given":"Bruno","family":"Escoffier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-2391-029X","authenticated-orcid":false,"given":"Minh-Hang","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6782-7625","authenticated-orcid":false,"given":"Mika\u00ebl","family":"Rabie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Even, S.: Efficient and reliable broadcast is achievable in an eventually connected network. In: Proceedings of the Third Annual ACM Symposium on Principles of Distributed Computing, pp. 278\u2013281 (1984)","DOI":"10.1145\/800222.806754"},{"key":"3_CR2","unstructured":"Bar-Noy, A., Schieber, B.: The Canadian traveller problem. In: Proceedings of the Second Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 261\u2013270 (1991)"},{"key":"3_CR3","doi-asserted-by":"publisher","unstructured":"Bellitto, T., Cohen, J., Escoffier, B., Nguyen, M., Rabie, M.: Canadian traveller problems in temporal graphs. CoRR arxiv:2407.16491 (2024). https:\/\/doi.org\/10.48550\/ARXIV.2407.16491","DOI":"10.48550\/ARXIV.2407.16491"},{"issue":"1","key":"3_CR4","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s10878-013-9634-8","volume":"30","author":"M Bender","year":"2015","unstructured":"Bender, M., Westphal, S.: An optimal randomized online algorithm for the k-Canadian traveller problem on node-disjoint paths. J. Comb. Optim. 30(1), 87\u201396 (2015)","journal-title":"J. Comb. Optim."},{"key":"3_CR5","doi-asserted-by":"publisher","unstructured":"Bil\u00f2, D., D\u2019Angelo, G., Gual\u00e0, L., Leucci, S., Rossi, M.: Sparse temporal spanners with low stretch. In: Chechik, S., Navarro, G., Rotenberg, E., Herman, G. (eds.) 30th Annual European Symposium on Algorithms, ESA 2022, Berlin\/Potsdam, Germany, 5\u20139 September 2022. LIPIcs, vol.\u00a0244, pp. 19:1\u201319:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022). https:\/\/doi.org\/10.4230\/LIPICS.ESA.2022.19","DOI":"10.4230\/LIPICS.ESA.2022.19"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/J.JCSS.2021.04.004","volume":"121","author":"A Casteigts","year":"2021","unstructured":"Casteigts, A., Peters, J.G., Schoeters, J.: Temporal cliques admit sparse spanners. J. Comput. Syst. Sci. 121, 1\u201317 (2021). https:\/\/doi.org\/10.1016\/J.JCSS.2021.04.004","journal-title":"J. Comput. Syst. Sci."},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"1524","DOI":"10.1007\/s00453-020-00792-6","volume":"83","author":"ED Demaine","year":"2021","unstructured":"Demaine, E.D., Huang, Y., Liao, C.S., Sadakane, K.: Approximating the Canadian traveller problem with online randomization. Algorithmica 83, 1524\u20131543 (2021)","journal-title":"Algorithmica"},{"key":"3_CR8","doi-asserted-by":"publisher","unstructured":"Dibbelt, J., Strasser, B., Wagner, D.: Delay-robust journeys in timetable networks with minimum expected arrival time. In: Funke, S., Mihal\u00e1k, M. (eds.) 14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2014, Wroclaw, Poland, 11 September 2014. OASIcs, vol.\u00a042, pp. 1\u201314. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2014https:\/\/doi.org\/10.4230\/OASICS.ATMOS.2014.1","DOI":"10.4230\/OASICS.ATMOS.2014.1"},{"key":"3_CR9","doi-asserted-by":"publisher","unstructured":"F\u00fcchsle, E., Molter, H., Niedermeier, R., Renken, M.: Delay-robust routes in temporal graphs. In: Berenbrink, P., Monmege, B. (eds.) 39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, Marseille, France (Virtual Conference), 15\u201318 March 2022. LIPIcs, vol.\u00a0219, pp. 30:1\u201330:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022).https:\/\/doi.org\/10.4230\/LIPICS.STACS.2022.30","DOI":"10.4230\/LIPICS.STACS.2022.30"},{"issue":"3","key":"3_CR10","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.physrep.2012.03.001","volume":"519","author":"P Holme","year":"2012","unstructured":"Holme, P., Saram\u00e4ki, J.: Temporal networks. Phys. Rep. 519(3), 97\u2013125 (2012)","journal-title":"Phys. Rep."},{"issue":"4","key":"3_CR11","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1006\/JCSS.2002.1829","volume":"64","author":"D Kempe","year":"2002","unstructured":"Kempe, D., Kleinberg, J.M., Kumar, A.: Connectivity and inference problems for temporal networks. J. Comput. Syst. Sci. 64(4), 820\u2013842 (2002). https:\/\/doi.org\/10.1006\/JCSS.2002.1829","journal-title":"J. Comput. Syst. Sci."},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1007\/978-3-642-39212-2_57","volume-title":"Automata, Languages, and Programming","author":"GB Mertzios","year":"2013","unstructured":"Mertzios, G.B., Michail, O., Chatzigiannakis, I., Spirakis, P.G.: Temporal network optimization subject to connectivity constraints. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013. LNCS, vol. 7966, pp. 657\u2013668. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39212-2_57"},{"key":"3_CR13","unstructured":"Nikolova, E., Karger, D.R.: Route planning under uncertainty: the Canadian traveller problem. In: AAAI, pp. 969\u2013974 (2008)"},{"issue":"1","key":"3_CR14","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/0304-3975(91)90263-2","volume":"84","author":"CH Papadimitriou","year":"1991","unstructured":"Papadimitriou, C.H., Yannakakis, M.: Shortest paths without a map. Theor. Comput. Sci. 84(1), 127\u2013150 (1991)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Polychronopoulos, G.H., Tsitsiklis, J.N.: Stochastic shortest path problems with recourse. Netw. Int. J. 27(2), 133\u2013143 (1996)","DOI":"10.1002\/(SICI)1097-0037(199603)27:2<133::AID-NET5>3.0.CO;2-L"},{"issue":"1","key":"3_CR16","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1287\/OPRE.41.1.91","volume":"41","author":"HN Psaraftis","year":"1993","unstructured":"Psaraftis, H.N., Tsitsiklis, J.N.: Dynamic shortest paths in acyclic networks with Markovian arc costs. Oper. Res. 41(1), 91\u2013101 (1993). https:\/\/doi.org\/10.1287\/OPRE.41.1.91","journal-title":"Oper. Res."},{"issue":"2","key":"3_CR17","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0022-0000(78)90045-4","volume":"16","author":"TJ Schaefer","year":"1978","unstructured":"Schaefer, T.J.: On the complexity of some two-person perfect-information games. J. Comput. Syst. Sci. 16(2), 185\u2013225 (1978)","journal-title":"J. Comput. Syst. Sci."},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Stockmeyer, L.J., Meyer, A.R.: Word problems requiring exponential time (preliminary report). In: Proceedings of the Fifth Annual ACM Symposium on Theory of Computing, pp.\u00a01\u20139 (1973)","DOI":"10.1145\/800125.804029"},{"issue":"3","key":"3_CR19","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.ipl.2007.10.004","volume":"106","author":"S Westphal","year":"2008","unstructured":"Westphal, S.: A note on the k-Canadian traveller problem. Inf. Process. Lett. 106(3), 87\u201389 (2008)","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-11835-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:43:38Z","timestamp":1767314618000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-11835-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032118349","9783032118356"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-11835-6_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"2 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Otzenhausen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"51","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo.uni-trier.de\/wg2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}