Group sweep coverage with guaranteed approximation ratio

DOI10.1016/J.TCS.2020.05.012MaRDI QIDQ2193266zbMATH OpenOpenAlexFDO

Authors Chuang Liu, Qiang Ye, Wen Xu, Hongwei 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

zbMATH Keywords

approximation algorithmsweep coveragesweep routewireless sensor networks

Mathematics Subject Classification ID

Wireless sensor networks as related to computer science (68M18) Approximation algorithms (68W25)

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 algorithm for sweep coverage on graph
• Approximation Algorithms for Barrier Sweep Coverage
• 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

(9)

• Time sensitive sweep coverage with minimum UAVs
• Approximation algorithm for prize-collecting sweep cover with base stations
• Data sensing with limited mobile sensors in sweep coverage
• Algorithms for max-value path sweep coverage in mobile sensor networks
• A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems
• Algorithm for partial sweep coverage on a line
• UAV-based sweep coverage for time-sensitive targets with restricted visible areas
• Approximation algorithm for min sweep-period sweep cover with distance constraint
• Approximation algorithm for unrooted prize-collecting forest with multiple components and its application on prize-collecting 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)