Canadian traveler problems in temporal graphs

DOI10.1007/978-3-032-11835-6_3MaRDI QIDQ7294419zbMATH OpenFDO

Authors Thomas Bellitto, Johanne Cohen, Bruno Escoffier, Minh-Hang Nguyen, Mikaël Rabie

Publication date 10 July 2026

Full work available at URL https://doi.org/10.1007/978-3-032-11835-6_3

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites work

• A note on the k-Canadian traveller problem
• An optimal randomized online algorithm for the \(k\)-Canadian traveller problem on node-disjoint paths
• Approximating the Canadian traveller problem with online randomization
• Connectivity and inference problems for temporal networks
• Delay-robust routes in temporal graphs
• Dynamic Shortest Paths in Acyclic Networks with Markovian Arc Costs
• scientific article; zbMATH DE number 432827 (Why is no real title available?)
• scientific article; zbMATH DE number 3560737 (Why is no real title available?)
• On the complexity of some two-person perfect-information games
• Shortest paths without a map
• Sparse temporal spanners with low stretch
• Stochastic shortest path problems with recourse
• Temporal cliques admit sparse spanners
• Temporal network optimization subject to connectivity constraints

This page was built for publication: Canadian traveler problems in temporal graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7294419)