New approximations for maximum lifetime coverage
From MaRDI portal
Recommendations
- Hybrid approximation for minimum-cost target coverage in wireless sensor networks
- Constant approximation for the lifetime scheduling problem of \(p\)-percent coverage
- On the maximization of the lifetime of a sensor network subject to limited resources
- Efficient point coverage in wireless sensor networks
- \(\alpha\)-coverage to extend network lifetime on wireless sensor networks
Cites work
- A \(5+\varepsilon\)-approximation algorithm for minimum weighted dominating set in unit disk graph
- A better constant-factor approximation for weighted dominating set in unit disk graph
- Design and analysis of approximation algorithms
- New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs
Cited in
(5)- Constant approximation for the lifetime scheduling problem of \(p\)-percent coverage
- Polynomial time approximation scheme for t-latency bounded information propagation problem in wireless networks
- Constant-approximation for minimum weight partial sensor cover
- A 1/2 approximation algorithm for energy-constrained geometric coverage problem
- Hybrid approximation for minimum-cost target coverage in wireless sensor networks
This page was built for publication: New approximations for maximum lifetime coverage
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5169461)
