Canadian-traveller-problem Definition


(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).


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

Find Similar Words

Find similar words to canadian-traveller-problem using the buttons below.

Words Starting With

Words Ending With

Word Length