Abstract
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.
Original language | English |
---|---|
Pages (from-to) | 106-110 |
Journal | Operations Research Letters |
Volume | 34 |
Issue number | 1 |
DOIs | |
Publication status | Published - 2006 |