Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs.
Haim KaplanMoshe LewensteinNira ShafrirMaxim SviridenkoPublished in: J. ACM (2005)
Keyphrases
- approximation algorithms
- np hard
- traveling salesman problem
- special case
- worst case
- vertex cover
- optimal solution
- set cover
- lower bound
- open shop
- scheduling problem
- facility location problem
- np hardness
- constant factor
- exact algorithms
- primal dual
- minimum cost
- randomized algorithms
- approximation schemes
- genetic algorithm
- communication networks
- network design problem
- approximation ratio
- search space
- ant colony optimization
- upper bound
- polynomial time approximation
- undirected graph
- precedence constraints
- integer programming
- constraint satisfaction problems
- optimization problems
- disjoint paths
- branch and bound algorithm
- objective function