We give a polynomial-time algorithm for finding a solution to the Traveling Salesman Problem when the points given are constrained to lie on a fixed set of smooth curves of finite length.
|Number of pages||8|
|Publication status||Published - Sep 2001|
- Euclidean traveling salesman problem
- Polynomial algorithm
- Traveling salesman problem