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