Approximation algorithms for distance constraint sweep coverage with base stations.
Jian LiangXiaohui HuangZhao ZhangPublished in: J. Comb. Optim. (2019)
Keyphrases
- approximation algorithms
- base station
- np hard
- special case
- wireless sensor networks
- wireless networks
- vertex cover
- worst case
- cellular networks
- minimum cost
- mobile networks
- received signal strength
- communication networks
- sensor networks
- energy consumption
- mobile users
- facility location problem
- precedence constraints
- approximation schemes
- approximation ratio
- open shop
- longest common subsequence
- set cover
- network design problem
- ad hoc networks
- randomized algorithms
- undirected graph
- primal dual
- combinatorial auctions
- constant factor
- linear programming
- disjoint paths