Energy-constrained geometric coverage problem

DOI10.1007/978-3-031-16081-3_23zbMath1522.90162OpenAlexW4296168415MaRDI QIDQ6167018

Huan Lan

Publication date: 7 July 2023

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-031-16081-3_23

zbMATH Keywords

greedy algorithmapproximation ratiogeometric coveringenergy-constrained

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Wireless sensor networks as related to computer science (68M18)

Cites Work

• Unnamed Item
• A note on maximizing a submodular set function subject to a knapsack constraint
• The budgeted maximum coverage problem
• Maximum coverage problem with group budget constraints
• Approximation algorithms for maximum coverage with group budget constraints
• A refined analysis of submodular greedy
• A primal-dual approximation algorithm for the \(k\)-prize-collecting minimum power cover problem
• A note on the minimum power partial cover problem on the plane
• Approximation algorithms for the minimum power cover problem with submodular/linear penalties
• Practical budgeted submodular maximization
• Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Algorithms – ESA 2005

This page was built for publication: Energy-constrained geometric coverage problem