An Empirical Analysis of Approximation Algorithms for Euclidean TSP.
Bárbara RodekerM. Virginia CifuentesLiliana FavrePublished in: CSC (2009)
Keyphrases
- approximation algorithms
- np hard
- traveling salesman problem
- special case
- vertex cover
- minimum cost
- worst case
- set cover
- search space
- optimal solution
- network design problem
- primal dual
- approximation ratio
- ant colony optimization
- facility location problem
- euclidean distance
- randomized algorithms
- np hardness
- constant factor
- approximation schemes
- exact algorithms
- constant factor approximation
- integer programming
- combinatorial optimization
- optimization problems
- scheduling problem
- lower bound
- greedy heuristic
- open shop
- disjoint paths
- precedence constraints
- undirected graph
- combinatorial auctions
- genetic algorithm