Constant-approximation for minimum weight partial sensor cover

DOI10.1142/S1793830921500476MaRDI QIDQ5013505zbMATH OpenOpenAlexFDO

Authors S. W. Liu, Hongmin W. Du

Publication date 30 November 2021

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s1793830921500476

zbMATH Keywords

constant-approximation algorithmdynamic program techniqueminimum weight sensor coverpartial sensor cover

Mathematics Subject Classification ID

Approximation algorithms (68W25)

Recommendations

• Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks
• A note on the minimum power partial cover problem on the plane
• Approximation algorithms for the minimum power partial cover problem

Cites work

• (6 + ε)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs
• A (4 + ε)-Approximation for the Minimum-Weight Dominating Set Problem in Unit Disk Graphs
• A \(5+\varepsilon\)-approximation algorithm for minimum weighted dominating set in unit disk graph
• A PTAS for the Weighted Unit Disk Cover Problem
• Approximation algorithms for partial covering problems
• Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
• New approximations for maximum lifetime coverage
• New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs

Cited in

(3)

• Monotonic optimization for sensor cover energy problem
• scientific article; zbMATH DE number 6381738 (Why is no real title available?)
• Approximation algorithms for maximum weighted target cover problem with distance limitations

This page was built for publication: Constant-approximation for minimum weight partial sensor cover

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5013505)