An O(N log N) Expected Time Merge Heuristic for the Planar ETSP

Chadha, Ritu and Allison, Donald C. S. (1988) An O(N log N) Expected Time Merge Heuristic for the Planar ETSP. Technical Report TR-88-16, Computer Science, Virginia Polytechnic Institute and State University.

Full text available as:
PDF - Requires Adobe Acrobat Reader or other PDF viewer.
TR-88-16.pdf (618738)

Abstract

We discuss a new heuristic for solving the Euclidean Traveling Salesman Problem (ETSP). This heuristic is a convex hull-based method and makes use of the Delaunay triangulation of the set of cities to compute a tour for the given set of cities. We conjecture that the expected running time for this algorithm is O(N log N), implying that a new and faster ETSP heuristic is now available.

Item Type:	Departmental Technical Report
Subjects:	Computer Science > Historical Collection(Till Dec 2001)
ID Code:	101
Deposited By:	User autouser
Deposited On:	05 December 2001