--
Minh Hang Nguyen
(IRIF)
summary: We focus on the Canadian Traveller Problem, where a traveller aims to travel on a network
from s to t with the minimum cost, considering that a maximum of k edges can be blocked. These
edges remain hidden from the traveller until they visit one of their endpoints. We ...
