Approximation algorithm for minimum partial multi-cover under a geometric setting
From MaRDI portal
Publication:2115321
DOI10.1007/S11590-021-01746-9zbMATH Open1487.90566OpenAlexW3163833635MaRDI QIDQ2115321FDOQ2115321
Authors: Yingli Ran, Zhao Zhang, Du Ding-Zhu, Xiaohui 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
Recommendations
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Using homogeneous weights for approximating the partial cover problem
- Title not available (Why is that?)
- Approximation algorithms for partial covering problems
- Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling
- Approximation schemes for covering and packing problems in image processing and VLSI
- Geometric approximation algorithms
- The densest \(k\)-subhypergraph problem
- Positive Influence Dominating Set in Online Social Networks
- Approximation algorithm for partial positive influence problem in social network
- On positive influence dominating sets in social networks
- Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph
- Weighted geometric set multi-cover via quasi-uniform sampling
- Geometric red-blue set cover for unit squares and related problems
- Approximation algorithm for the partial set multi-cover problem
- On partial covering for geometric set systems
- Local ratio method on partial set multi-cover
- A primal-dual algorithm for the minimum partial set multi-cover problem
- On the set multicover problem in geometric settings
- A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem
- Breaking thermaxBarrier: Enhanced Approximation Algorithms for Partial Set Multicover Problem
- Minimizing the union: tight approximations for small set bipartite vertex expansion
Cited In (8)
- On the set multicover problem in geometric settings
- On partial covering for geometric set systems
- Improved approximation algorithms for geometric set cover
- A bicriteria approximation algorithm for minimum submodular cost partial multi-cover problem
- Linear Time Approximation Schemes for Geometric Maximum Coverage
- On the geometric set multicover problem
- A primal-dual algorithm for the minimum partial set multi-cover problem
- On the set multi-cover problem in geometric settings
This page was built for publication: Approximation algorithm for minimum partial multi-cover under a geometric setting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2115321)
