Group sweep coverage with guaranteed approximation ratio
From MaRDI portal
Publication:2193266
DOI10.1016/j.tcs.2020.05.012zbMath1452.68029OpenAlexW3029537934MaRDI QIDQ2193266
Wen Xu, Qiang Ye, Chuang Liu, Hongwei David Du
Publication date: 25 August 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2020.05.012
Related Items
Approximation algorithm for prize-collecting sweep cover with base stations, A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems, Time sensitive sweep coverage with minimum UAVs
Cites Work
- A joint optimization of data ferry trajectories and communication powers of ground sensors for long-term environmental monitoring
- Approximation algorithm for sweep coverage on graph
- Solving energy issues for sweep coverage in wireless sensor networks
- 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
- Approximation Algorithms for Barrier Sweep Coverage