Thursday, 18 January 2007

computer science - Travelling Salesman Problem

Yes, as long as your distance does not satisfy the triangle inequality. Here is a series of points which form a shortest route under the Hamming distance. If you plot them on the plane, you will notice that they cross over.



(1,1)
(1,2)
(4,2)
(3,2)
(0,2)
(0,1)

No comments:

Post a Comment