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

Gautam Das Sanjiv Kapoor Michiel H. M. Smid

Published in: FSTTCS (1996)

Keyphrases

traveling salesman
minimum spanning trees
traveling salesman problem
minimum spanning tree
ant colony optimization
computational complexity
global optimization
quadratic assignment problem
neural network
machine learning
training data
combinatorial optimization