The Canadian Traveller Problem on outerplanar graphs

Laurent Beaudou, Pierre Bergé, Vsevolod Chernyshev +5

We study the $k$-Canadian Traveller Problem, where a weighted graph $G=(V,E,\ddot{I}‰)$ with a source $s\in V$ and a target $t\in V$ are given. This problem also has a hidden input $E_* \…