A primal-dual algorithm for the minimum power partial cover problem
type: Item
instance of: scholarly article
title: A primal-dual algorithm for the minimum power partial cover problem
zbMATH Open document ID: 1502.90152
author: Menghong Li
author: Yingli Ran
author: Zhao Zhang
published in: Journal of Combinatorial Optimization
publication date: 2022-10-04T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7595925
zbMATH Keywords: power
zbMATH Keywords: partial cover
zbMATH Keywords: primal dual
zbMATH Keywords: approximation algorithm
MaRDI profile type: Publication
full work available at URL: s10878-020-00567-3
OpenAlex ID: W3015834807
cites work: Weighted Geometric Set Multi-cover via Quasi-uniform Sampling
cites work: Using homogeneous weights for approximating the partial cover problem
cites work: A note on multicovering with disks
cites work: A constant-factor approximation for multi-covering with disks
cites work: Fault-tolerant covering problems in metric spaces
cites work: Q5743501
cites work: A Greedy Heuristic for the Set-Covering Problem
cites work: Approximation algorithms for partial covering problems
cites work: Approximation Algorithms for the Set Covering and Vertex Cover Problems
cites work: On Partial Covering For Geometric Set Systems
cites work: Approximation algorithms for combinatorial problems
cites work: Approximation algorithm for partial set multicover versus full set multicover
cites work: Improved results on geometric hitting set problems
cites work: Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces
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: Packing and covering with non-piercing regions
cites work: Improved performance of the greedy algorithm for partial cover
cites work: Weighted geometric set cover via quasi-uniform sampling
cites work: Q4782696
DOI: 10.1007/S10878-020-00567-3
description: scientific article; zbMATH DE number 7595925