Approximation Algorithms for Euclidean Group TSP.
Khaled M. ElbassioniAleksei V. FishkinNabil H. MustafaRené SittersPublished in: ICALP (2005)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- traveling salesman problem
- facility location problem
- open shop
- set cover
- vertex cover
- approximation ratio
- lie group
- exact algorithms
- minimum cost
- approximation schemes
- randomized algorithms
- constant factor
- euclidean distance
- np hardness
- primal dual
- network design problem
- search space
- particle swarm optimization
- scheduling problem
- polynomial time approximation
- lower bound
- objective function
- error bounds
- computational complexity
- search algorithm