The traveling salesman problem with few inner points

We propose two algorithms for the planar Euclidean traveling salesman problem. The first runs in O(k!kn) time and O(k) space, and the second runs in O(2(k)k(2)n) time and O(2(k)kn) space, where n denotes the number of input points and k denotes the number of points interior to the convex hull. (c) 2005 Elsevier B.V. All rights reserved