Approximation algorithms for the Euclidean bipartite TSP.
Andreas BaltzAnand SrivastavPublished in: Oper. Res. Lett. (2005)
Keyphrases
- polynomial time approximation
- approximation algorithms
- np hard
- undirected graph
- traveling salesman problem
- special case
- vertex cover
- worst case
- optimal solution
- minimum cost
- facility location problem
- primal dual
- euclidean distance
- ant colony optimization
- approximation ratio
- bipartite graph
- network design problem
- np hardness
- approximation schemes
- graph model
- integer programming
- combinatorial optimization
- search space
- genetic algorithm
- linear programming
- approximation guarantees
- lower bound
- open shop
- greedy heuristic
- set cover
- constant factor
- randomized algorithms
- computational complexity
- greedy algorithm