A note on the minimum power partial cover problem on the plane

DOI10.1007/S10878-022-00869-8zbMATH Open1497.90167OpenAlexW4291278197WikidataQ114225857 ScholiaQ114225857MaRDI QIDQ2165259FDOQ2165259

Han Dai, Weidong Li, Xiaofei Liu, Bin Deng

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

zbMATH Keywords

approximation algorithmprimal dualpower partial coverrelaxed independent set

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• A unified approach to approximating partial covering problems
• Approximation and Online Algorithms
• Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks
• Minimum power partial multi-cover on a line
• A primal-dual algorithm for the minimum power partial cover problem

Cited In (9)

• 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
• Minimum power partial multi-cover on a line
• The bound coverage problem by aligned disks in \(L_1\) metric
• 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)