On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees

Gautam Das, Sanjiv Kapoor, Michiel H. M. Smid. On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees. Algorithmica, 19(4):447-460, 1997.

Abstract

Abstract is missing.