Approximation Algorithms for Generalized MST and TSP in Grid Clusters.
Binay K. BhattacharyaAnte CusticAkbar RafieyArash RafieyVladyslav SokolPublished in: COCOA (2015)
Keyphrases
- approximation algorithms
- np hard
- special case
- traveling salesman problem
- worst case
- vertex cover
- clustering algorithm
- minimum spanning tree
- open shop
- minimum cost
- grid cells
- facility location problem
- primal dual
- search space
- optimal solution
- np hardness
- approximation ratio
- approximation schemes
- network design problem
- set cover
- constant factor
- ant colony optimization
- minimal spanning tree
- optimization problems
- scheduling problem
- randomized algorithms
- genetic algorithm
- computational complexity
- strongly np hard
- precedence constraints
- data points
- undirected graph
- particle swarm optimization
- branch and bound algorithm