TY - JOUR

T1 - The traveling salesman problem with few inner points

AU - Deineko, V.G.

AU - Hoffmann, M.

AU - Okamoto, Y.

AU - Woeginger, G.J.

PY - 2006

Y1 - 2006

N2 - 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(2kk2n) time and O(2kkn) space, where n denotes the number of input points and k denotes the number of points interior to the convex hull.

AB - 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(2kk2n) time and O(2kkn) space, where n denotes the number of input points and k denotes the number of points interior to the convex hull.

U2 - 10.1016/j.orl.2005.01.002

DO - 10.1016/j.orl.2005.01.002

M3 - Article

VL - 34

SP - 106

EP - 110

JO - Operations Research Letters

JF - Operations Research Letters

SN - 0167-6377

IS - 1

ER -