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