Approximation Algorithms for Not Necessarily Disjoint Clustered TSP.
Nili Guttmann-BeckEyal KnaanMichal SternPublished in: J. Graph Algorithms Appl. (2018)
Keyphrases
- approximation algorithms
- np hard
- traveling salesman problem
- special case
- vertex cover
- worst case
- ant colony optimization
- minimum cost
- open shop
- facility location problem
- search space
- set cover
- network design problem
- combinatorial optimization
- optimal solution
- pairwise
- randomized algorithms
- approximation ratio
- genetic algorithm
- primal dual
- constant factor
- exact algorithms
- np hardness
- branch and bound algorithm
- approximation schemes
- metaheuristic
- undirected graph
- combinatorial auctions
- scheduling problem
- computational complexity
- closest string
- disjoint paths
- constant factor approximation