Approximation algorithms for the minimum power partial cover problem

DOI10.1007/978-3-030-27195-4_17MaRDI QIDQ6199014OpenAlexFDO

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

zbMATH Keywords

approximation algorithmpartial coverlocal ratio

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25) Wireless sensor networks as related to computer science (68M18)

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

Cited in

(5)

• An improved approximation algorithm for the \(k\)-prize-collecting minimum power cover problem
• Constant-approximation for minimum weight partial sensor cover
• An approximation algorithm for the minimum soft capacitated disk multi-coverage problem
• PTAS for minimum cost multicovering with disks
• An approximation algorithm for the \(H\)-prize-collecting power cover 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)