Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01061238n
Noun Concept
Categories: PSPACE-complete problems, Travelling salesman problem, Computational problems in graph theory
EN
Canadian traveller problem  CTP
EN
In computer science and graph theory, the Canadian Traveller Problem is a generalization of the shortest path problem to graphs that are partially observable. Wikipedia
Definitions
Relations
Sources
EN
In computer science and graph theory, the Canadian Traveller Problem is a generalization of the shortest path problem to graphs that are partially observable. Wikipedia
A shortest path problem Wikipedia Disambiguation
generalization of the shortest path problem to graphs that are partially observable Wikidata
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). Wiktionary
IS A
optimization problem
DISCOVERER OR INVENTOR
Mihalis Yannakakis
Christos Papadimitriou
NAMED AFTER
Canada
Wikipedia
EN
Canadian traveller problem
Wikidata
EN
Canadian traveller problem
Wiktionary
EN
Canadian traveller problem
Wikipedia Redirections
EN
Canadian Traveller Problem
Wikidata Alias
EN
CTP

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License