Approximation algorithms for sweep coverage in wireless sensor networks.
Barun GorainPartha Sarathi MandalPublished in: J. Parallel Distributed Comput. (2014)
Keyphrases
- approximation algorithms
- wireless sensor networks
- np hard
- special case
- worst case
- minimum cost
- energy consumption
- set cover
- sensor networks
- facility location problem
- vertex cover
- routing protocol
- sensor nodes
- resource constrained
- open shop
- np hardness
- network design problem
- undirected graph
- exact algorithms
- primal dual
- approximation ratio
- randomized algorithms
- strongly np hard
- approximation schemes
- disjoint paths
- search algorithm
- precedence constraints
- branch and bound algorithm
- constant factor
- approximation guarantees
- directed graph
- theoretical analysis