Constant-approximation for prize-collecting min-sensor sweep coverage with base stations
From MaRDI portal
Publication:2151357
DOI10.1007/978-3-030-93176-6_1zbMath1498.68040OpenAlexW4205799442MaRDI QIDQ2151357
Publication date: 1 July 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-93176-6_1
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25) Wireless sensor networks as related to computer science (68M18)
Cites Work
- Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks
- 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
- Fault-tolerant covering problems in metric spaces
- An approximation algorithm for general energy restricted sweep coverage problem
- Minimum power partial multi-cover on a line
- Approximation algorithm for distance constraint sweep coverage without predetermined base stations
- A General Approximation Technique for Constrained Forest Problems
- Optimal Coverage in Wireless Sensor Networks
This page was built for publication: Constant-approximation for prize-collecting min-sensor sweep coverage with base stations
