Approximation algorithms for maximum weighted target cover problem with distance limitations

DOI10.1007/S10878-024-01166-2MaRDI QIDQ6571268zbMATH OpenFDO

Authors Jianhong Jin, Yingli Ran, Zhao Zhang

Publication date 11 July 2024

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10878-024-01166-2

zbMATH Keywords

approximation algorithmdistance constrainttarget coverage

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59) Applications of mathematical programming (90C90)

Recommendations

• Constant-approximation for minimum weight partial sensor cover
• Approximation algorithm for distance constraint sweep coverage without predetermined base stations
• Approximation algorithms for distance constraint sweep coverage with base stations

Cites work

• Approximation algorithm for MinSum linear barrier coverage with sink-based mobile sensors on the plane
• Approximation schemes for covering and packing problems in image processing and VLSI
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Barrier Coverage with Uniform Radii in 2D
• Coverage problems in sensor networks: a survey
• Efficient approximation algorithms for maximum coverage with group budget constraints
• Maximum coverage problem with group budget constraints
• Optimal coverage in wireless sensor networks

Cited in

(1)

• Approximation algorithm for fair stochastic maximum coverage problem

This page was built for publication: Approximation algorithms for maximum weighted target cover problem with distance limitations

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