Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks
From MaRDI portal
Publication:2046270
DOI10.1007/s10898-021-01033-yzbMath1475.90085OpenAlexW3161996405MaRDI QIDQ2046270
Zhao Zhang, Yingli Ran, Ding-Zhu Du, Xiao-hui Huang
Publication date: 17 August 2021
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-021-01033-y
Related Items
Constant Approximation for the Lifetime Scheduling Problem of p-Percent Coverage ⋮ Constant-approximation for prize-collecting min-sensor sweep coverage with base stations ⋮ A note on the minimum power partial cover problem on the plane ⋮ Approximation algorithms for the minimum power cover problem with submodular/linear penalties ⋮ The bound coverage problem by aligned disks in \(L_1\) metric ⋮ An improved approximation algorithm for the \(k\)-prize-collecting minimum power cover problem ⋮ An approximation algorithm for the \(H\)-prize-collecting power cover problem ⋮ A primal-dual approximation algorithm for the \(k\)-prize-collecting minimum power cover problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(\epsilon\)-nets and simplex range queries
- New applications of random sampling in computational geometry
- Clustering to minimize the sum of cluster diameters
- Almost optimal set covers in finite VC-dimension
- A note on multicovering with disks
- A primal-dual algorithm for the minimum partial set multi-cover problem
- Polynomial time approximation schemes for base station coverage with minimum total radii
- Fault-tolerant covering problems in metric spaces
- Minimum power partial multi-cover on a line
- Weighted geometric set cover via quasi-uniform sampling
- Weighted Geometric Set Multi-cover via Quasi-uniform Sampling
- A constant-factor approximation for multi-covering with disks
- A PTAS for the Weighted Unit Disk Cover Problem
- Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces
- Approximation algorithm for partial set multicover versus full set multicover
- MULTI COVER OF A POLYGON MINIMIZING THE SUM OF AREAS
- Polynomial-time approximation schemes for packing and piercing fat objects
- Approximation algorithms for partial covering problems
- Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph
- On Partial Covering For Geometric Set Systems
- Optimal Coverage in Wireless Sensor Networks
- A constant-factor approximation for multi-covering with disks
- On the set multi-cover problem in geometric settings
- Algorithms – ESA 2005
- Improved Approximation Algorithm for Set Multicover with Non-Piercing Regions.
- Approximation and Online Algorithms
