Talk:Canadian traveller problem
Add topicLatest comment: 15 years ago by Willyshop in topic Solution in O(1) time
 | This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | |||||||||||||||||||||||||||
| ||||||||||||||||||||||||||||
Problem definition
[edit]I made the problem definition up, I hope this is alright. Every paper I've read about this problem has merely given an informal explanation. C. lorenz (talk) 02:44, 4 October 2008 (UTC)
Requests/To do
[edit]- Problem variants.
- Algorithms.
- Example instance.
- Explanatory diagram.
- Concrete applications.
- More on approximability and proofs.
— c. lorenz (talk) 04:31, 4 October 2008 (UTC)
- More on open problems and the formalization of polynomial-size descriptions.
Solution in O(1) time
[edit]It's really quite simple, his problem is that he's Canadian. —Preceding unsigned comment added by Willyshop (talk • contribs) 03:06, 23 October 2010 (UTC)