Efficient approximation algorithms for offline and online unit disk multiple coverage.
Xuening GaoLongkun GuoKewen LiaoPublished in: Comput. Electr. Eng. (2022)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- vertex cover
- online learning
- open shop
- primal dual
- minimum cost
- disjoint paths
- approximation ratio
- randomized algorithms
- exact algorithms
- network design problem
- set cover
- constant factor
- upper bound
- constant factor approximation
- precedence constraints
- scheduling problem