Approximation algorithm for minimum partial multi-cover under a geometric setting
type: Item
instance of: scholarly article
title: Approximation algorithm for minimum partial multi-cover under a geometric setting
zbMATH Open document ID: 1487.90566
author: Yingli Ran
author: Zhao Zhang
author: Du Ding-Zhu
author: Xiaohui Huang
published in: Optimization Letters
publication date: 2022-03-15T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7490500
zbMATH Keywords: partial set multi-cover
zbMATH Keywords: unit square
zbMATH Keywords: approximation algorithm
MaRDI profile type: Publication
full work available at URL: s11590-021-01746-9
OpenAlex ID: W3163833635
cites work: Using homogeneous weights for approximating the partial cover problem
cites work: Weighted Geometric Set Multi-cover via Quasi-uniform Sampling
cites work: Q5743501
cites work: Geometric red-blue set cover for unit squares and related problems
cites work: On the set multicover problem in geometric settings
cites work: The Densest $k$-Subhypergraph Problem
cites work: Minimizing the Union: Tight Approximations for Small Set Bipartite Vertex Expansion
cites work: Approximation algorithms for partial covering problems
cites work: Q3010463
cites work: Approximation schemes for covering and packing problems in image processing and VLSI
cites work: On Partial Covering For Geometric Set Systems
cites work: Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph
cites work: Q4782696
cites work: Approximation algorithm for partial positive influence problem in social network
cites work: Local ratio method on partial set multi-cover
cites work: A primal-dual algorithm for the minimum partial set multi-cover problem
cites work: Breaking thermaxBarrier: Enhanced Approximation Algorithms for Partial Set Multicover Problem
cites work: Approximation algorithm for the partial set multi-cover problem
cites work: A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem
cites work: Positive Influence Dominating Set in Online Social Networks
cites work: On positive influence dominating sets in social networks
DOI: 10.1007/S11590-021-01746-9
description: scientific article; zbMATH DE number 7490500