Canadian-traveller-problem meaning

(computing theory) A generalization of the shortest path problem to graphs that are only partially observable (i.e. the graph is revealed while it is being explored).
noun
0
0
Advertisement

Origin of canadian-traveller-problem

  • Introduced by Christos Papadimitriou and Mihalis Yannakakis in 1989. Supposed to allude to the difficulties experienced by Canadian drivers with snowfall randomly blocking roads.

    From Wiktionary