Improved approximation algorithms for connected sensor cover.
Stefan FunkeAlexander KesselmanFabian KuhnZvi LotkerMichael SegalPublished in: Wirel. Networks (2007)
Keyphrases
- approximation algorithms
- np hard
- special case
- vertex cover
- worst case
- minimum cost
- facility location problem
- approximation ratio
- np hardness
- exact algorithms
- set cover
- network design problem
- primal dual
- randomized algorithms
- approximation schemes
- sensor networks
- lower bound
- disjoint paths
- precedence constraints
- undirected graph
- combinatorial auctions
- constant factor
- polynomial time approximation
- open shop
- partial order
- connected components
- optimization problems