Approximation Algorithms for the Connected Sensor Cover Problem.
Lingxiao HuangJian LiQicai ShiPublished in: CoRR (2015)
Keyphrases
- approximation algorithms
- np hard
- worst case
- special case
- sensor networks
- vertex cover
- set cover
- network design problem
- minimum cost
- approximation ratio
- np hardness
- facility location problem
- exact algorithms
- primal dual
- open shop
- disjoint paths
- precedence constraints
- constant factor approximation
- approximation schemes
- scheduling problem
- constant factor
- randomized algorithms