A PTAS for minimum weighted connected vertex cover $$P_3$$ P 3 problem in 3-dimensional wireless sensor networks.
Limin WangWenxue DuZhao ZhangXiaoyan ZhangPublished in: J. Comb. Optim. (2017)
Keyphrases
- vertex cover
- approximation algorithms
- wireless sensor networks
- polynomial time approximation
- minimum cost
- constant factor
- np hard
- peer to peer
- special case
- worst case
- error bounds
- approximation ratio
- multi dimensional
- spanning tree
- precedence constraints
- approximation guarantees
- routing protocol
- upper bound
- planar graphs
- dynamic programming
- lower bound