Traveling Salesman Problem
Input description: A weighted graph G, L
Output description: Is there a tour of length at most L that visits each of the vertices exactly once.
Optimization version: minimize the length of the tour.
Previous slide
Next slide
Back to first slide
View graphic version