Approximation algorithms for the minimum power cover problem with submodular/linear penalties
From MaRDI portal
Publication:2672626
DOI10.1016/j.tcs.2022.05.012OpenAlexW4280622886WikidataQ114129106 ScholiaQ114129106MaRDI QIDQ2672626
Xiaofei Liu, Weidong Li, Han Dai
Publication date: 13 June 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2022.05.012
Related Items (4)
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 ⋮ Energy-constrained geometric coverage problem
Cites Work
- Unnamed Item
- Unnamed Item
- Approximation algorithms for submodular vertex cover problems with linear/submodular penalties using primal-dual technique
- A push-relabel framework for submodular function minimization and applications to parametric optimization
- Clustering to minimize the sum of cluster diameters
- A note on multicovering with disks
- Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks
- Approximation algorithms for the multiprocessor scheduling with submodular penalties
- 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
- A constant-factor approximation for multi-covering with disks
- A Greedy Heuristic for the Set-Covering Problem
- MULTI COVER OF A POLYGON MINIMIZING THE SUM OF AREAS
- Polynomial-Time Approximation Schemes for Geometric Intersection Graphs
- Algorithms – ESA 2005
- Approximation and Online Algorithms
This page was built for publication: Approximation algorithms for the minimum power cover problem with submodular/linear penalties
