Approximation algorithms for the connected sensor cover problem.
Lingxiao HuangJian LiQicai ShiPublished in: Theor. Comput. Sci. (2020)
Keyphrases
- approximation algorithms
- np hard
- special case
- vertex cover
- worst case
- sensor networks
- facility location problem
- minimum cost
- primal dual
- network design problem
- np hardness
- randomized algorithms
- undirected graph
- approximation ratio
- open shop
- precedence constraints
- constant factor
- disjoint paths
- scheduling problem
- greedy heuristic
- practical problems
- connected components
- optimization problems
- approximation schemes
- upper bound
- lower bound