Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs.
Haim KaplanMoshe LewensteinNira ShafrirMaxim SviridenkoPublished in: FOCS (2003)
Keyphrases
- approximation algorithms
- np hard
- traveling salesman problem
- special case
- worst case
- communication networks
- vertex cover
- facility location problem
- minimum cost
- ant colony optimization
- optimal solution
- approximation schemes
- network design problem
- genetic algorithm
- open shop
- lower bound
- approximation ratio
- constant factor
- randomized algorithms
- set cover
- primal dual
- integer programming
- constant factor approximation
- exact algorithms
- undirected graph
- precedence constraints
- search space