Approximation algorithms for the unit disk cover problem in 2D and 3D.
Ahmad BiniazPaul LiuAnil MaheshwariMichiel H. M. SmidPublished in: Comput. Geom. (2017)
Keyphrases
- approximation algorithms
- np hard
- special case
- vertex cover
- facility location problem
- minimum cost
- open shop
- network design problem
- worst case
- np hardness
- primal dual
- set cover
- exact algorithms
- undirected graph
- constant factor
- randomized algorithms
- polynomial time approximation
- approximation schemes
- computational complexity
- simulated annealing
- upper bound
- disjoint paths
- constant factor approximation