Approximation algorithms for maximum weighted target cover problem with distance limitations

DOI10.1007/S10878-024-01166-2MaRDI QIDQ6571268

Jianhong Jin, Zhao Zhang, Yingli Ran

Publication date: 11 July 2024

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

zbMATH Keywords

approximation algorithmtarget coveragedistance constraint

Mathematics Subject Classification ID

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

Cites Work

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

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)