Login / Signup
Nearly linear time approximation schemes for Euclidean TSP and other geometric problems.
Sanjeev Arora
Published in:
Network Design: Connectivity and Facilities Location (1997)
Keyphrases
</>
approximation schemes
optimization problems
numerical methods
euclidean distance
traveling salesman problem
approximation algorithms
computer vision
data structure
feature vectors
simulated annealing
orders of magnitude
geometric constraints