Fast Approximation Algorithms for Multiple Coverage with Unit Disks.
Xuening GaoLongkun GuoKewen LiaoPublished in: WoWMoM (2022)
Keyphrases
- approximation algorithms
- np hard
- special case
- minimum cost
- vertex cover
- network design problem
- primal dual
- worst case
- facility location problem
- randomized algorithms
- disjoint paths
- exact algorithms
- precedence constraints
- set cover
- constant factor
- polynomial time approximation
- genetic algorithm
- approximation ratio
- open shop