A 1/2 approximation algorithm for energy-constrained geometric coverage problem
From MaRDI portal
Publication:6535282
DOI10.1007/978-981-19-8152-4_7zbMATH Open1541.68446MaRDI QIDQ6535282
Publication date: 2 December 2023
Approximation methods and heuristics in mathematical programming (90C59) 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
- Title not available (Why is that?)
- The budgeted maximum coverage problem
- Maximum coverage problem with group budget constraints
- Approximation algorithms for maximum coverage with group budget constraints
- Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks
- 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
- A primal-dual algorithm for the minimum partial set multi-cover problem
- A PTAS for the disk cover problem of geometric objects
- Polynomial time approximation schemes for base station coverage with minimum total radii
- Approximation algorithms for the minimum power cover problem with submodular/linear penalties
- Practical budgeted submodular maximization
- Multi Cover of a Polygon Minimizing the Sum of Areas
- Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Algorithms – ESA 2005
- Algorithms for the line-constrained disk coverage and related problems
- Energy-constrained geometric coverage problem
Related Items (1)
This page was built for publication: A 1/2 approximation algorithm for energy-constrained geometric coverage problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535282)
