Approximation algorithms for the minimum power partial cover problem
DOI10.1007/978-3-030-27195-4_17OpenAlexW2964827634MaRDI QIDQ6199014FDOQ6199014
Authors: Menghong Li, Yingli Ran, Zhao Zhang 
Publication date: 23 February 2024
Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-27195-4_17
Recommendations
- A note on the minimum power partial cover problem on the plane
- A primal-dual algorithm for the minimum power partial cover problem
- Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks
- Minimum power partial multi-cover on a line
- A primal-dual approximation algorithm for the \(k\)-prize-collecting minimum power cover problem
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25) Wireless sensor networks as related to computer science (68M18)
Cited In (4)
- An approximation algorithm for the \(H\)-prize-collecting power cover problem
- An improved approximation algorithm for the \(k\)-prize-collecting minimum power cover problem
- PTAS for minimum cost multicovering with disks
- An approximation algorithm for the minimum soft capacitated disk multi-coverage problem
This page was built for publication: Approximation algorithms for the minimum power partial cover problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6199014)
