Improved Approximation Algorithms for Connected Sensor Cover.
Stefan FunkeAlexander KesselmanZvi LotkerMichael SegalPublished in: ADHOC-NOW (2004)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- minimum cost
- open shop
- vertex cover
- facility location problem
- approximation ratio
- sensor networks
- exact algorithms
- primal dual
- precedence constraints
- network design problem
- np hardness
- randomized algorithms
- connected components
- set cover
- constant factor
- approximation schemes
- combinatorial auctions
- undirected graph
- computational complexity