Group sweep coverage with guaranteed approximation ratio
From MaRDI portal
Recommendations
- An approximation algorithm for general energy restricted sweep coverage problem
- Approximation Algorithms for Barrier Sweep Coverage
- Solving energy issues for sweep coverage in wireless sensor networks
- Algorithms for max-value path sweep coverage in mobile sensor networks
- Energy efficient sweep coverage with mobile and static sensors
Cites work
- A joint optimization of data ferry trajectories and communication powers of ground sensors for long-term environmental monitoring
- Approximation Algorithms for Barrier Sweep Coverage
- Approximation algorithm for sweep coverage on graph
- Approximation algorithms for distance constraint sweep coverage with base stations
- Data harvesting with mobile elements in wireless sensor networks
- Interference-Free k-barrier Coverage in Wireless Sensor Networks
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- Solving energy issues for sweep coverage in wireless sensor networks
Cited in
(6)- A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems
- Approximation algorithm for prize-collecting sweep cover with base stations
- Algorithm for partial sweep coverage on a line
- Algorithms for max-value path sweep coverage in mobile sensor networks
- Time sensitive sweep coverage with minimum UAVs
- Data sensing with limited mobile sensors in sweep coverage
This page was built for publication: Group sweep coverage with guaranteed approximation ratio
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2193266)