Canadian traveller problem

短语

释义与例句

n.
  1. 1.

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

    计算机 工程 数学

词源

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

来源：wiktionary