Approximation Algorithms for Planar Traveling Salesman Tours and Minimum-Length Triangulations.
Kenneth L. ClarksonPublished in: SODA (1991)
Keyphrases
- approximation algorithms
- traveling salesman
- minimum length
- traveling salesman problem
- special case
- minimum cost
- np hard
- shortest path
- vertex cover
- digital curves
- combinatorial optimization
- worst case
- constant factor
- ant colony optimization
- optimization problems
- approximation ratio
- global optimization
- shortest path problem
- quadratic assignment problem
- combinatorial optimization problems
- primal dual
- constant factor approximation
- valid inequalities
- exact algorithms
- evolutionary algorithm
- d objects
- lower bound
- objective function