Approximation algorithm for minimum partial multi-cover under a geometric setting
From MaRDI portal
Publication:2115321
DOI10.1007/s11590-021-01746-9zbMath1487.90566OpenAlexW3163833635MaRDI QIDQ2115321
Zhao Zhang, Yingli Ran, Ding-Zhu Du, Xiao-hui Huang
Publication date: 15 March 2022
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-021-01746-9
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximation algorithm for partial positive influence problem in social network
- On positive influence dominating sets in social networks
- Approximation algorithm for the partial set multi-cover problem
- A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem
- A primal-dual algorithm for the minimum partial set multi-cover problem
- Geometric red-blue set cover for unit squares and related problems
- Local ratio method on partial set multi-cover
- Using Homogeneous Weights for Approximating the Partial Cover Problem
- Weighted Geometric Set Multi-cover via Quasi-uniform Sampling
- On the set multicover problem in geometric settings
- The Densest $k$-Subhypergraph Problem
- Positive Influence Dominating Set in Online Social Networks
- Approximation schemes for covering and packing problems in image processing and VLSI
- Minimizing the Union: Tight Approximations for Small Set Bipartite Vertex Expansion
- Approximation algorithms for partial covering problems
- Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph
- Breaking thermaxBarrier: Enhanced Approximation Algorithms for Partial Set Multicover Problem
- On Partial Covering For Geometric Set Systems
This page was built for publication: Approximation algorithm for minimum partial multi-cover under a geometric setting
