A note on the minimum power partial cover problem on the plane
From MaRDI portal
Publication:2165259
DOI10.1007/S10878-022-00869-8zbMATH Open1497.90167OpenAlexW4291278197WikidataQ114225857 ScholiaQ114225857MaRDI QIDQ2165259FDOQ2165259
Authors: Han Dai, Bin Deng, Weidong Li, Xiaofei Liu 
Publication date: 19 August 2022
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-022-00869-8
Recommendations
- A primal-dual algorithm for the minimum power partial cover problem
- Minimum power partial multi-cover on a line
- Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks
- A primal-dual approximation algorithm for the \(k\)-prize-collecting minimum power cover problem
- Multi cover of a polygon minimizing the sum of areas
Cites Work
Cited In (13)
- An approximation algorithm for the \(H\)-prize-collecting power cover problem
- An improved approximation algorithm for the \(k\)-prize-collecting minimum power cover problem
- Energy-constrained geometric coverage problem
- A 1/2 approximation algorithm for energy-constrained geometric coverage problem
- Min-Power Covering Problems
- Approximation algorithms 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
- The bound coverage problem by aligned disks in \(L_1\) metric
- A primal-dual approximation algorithm for the \(k\)-prize-collecting minimum power cover problem
- A primal-dual algorithm for the minimum power partial cover problem
- Improved approximation algorithms for minimum power covering problems
- An approximation algorithm for the minimum soft capacitated disk multi-coverage problem
This page was built for publication: A note on the minimum power partial cover problem on the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2165259)
