Approximation Algorithms for Generalized TSP in Grid Clusters.
Michael Yu. KhachayKatherine NeznakhinaPublished in: DOOR (Supplement) (2016)
Keyphrases
- approximation algorithms
- np hard
- special case
- vertex cover
- worst case
- clustering algorithm
- traveling salesman problem
- minimum cost
- np hardness
- set cover
- constant factor
- optimal solution
- facility location problem
- ant colony optimization
- randomized algorithms
- linear programming
- approximation schemes
- open shop
- grid cells
- genetic algorithm
- approximation ratio
- constant factor approximation
- network design problem
- precedence constraints
- primal dual
- undirected graph
- knapsack problem
- polynomial time approximation
- data points
- evolutionary algorithm
- lower bound
- approximation guarantees
- branch and bound algorithm
- scheduling problem
- disjoint paths
- search space