Next: Problem 6 - Euler's
Up: Information Science II
Previous: Problem 4 - LRU
Concerning the traveling salesman problem, discuss it with respect to:
- 1.
- complexity classes,
- 2.
- exact algorithms,
- 3.
- approximate algorithms.
See [AHO83] for a detailed answer.
Reynald AFFELDT
2000-06-08