A primal-dual approximation algorithm for the \(k\)-prize-collecting minimum power cover problem
type: Item
instance of: scholarly article
title: A primal-dual approximation algorithm for the \(k\)-prize-collecting minimum power cover problem
zbMATH Open document ID: 1503.90116
author: Xiaofei Liu
author: Weidong Li
author: Runtao Xie
published in: Optimization Letters
publication date: 2022-10-11T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7599793
zbMATH Keywords: power cover
zbMATH Keywords: \(k\)-prize-collection
zbMATH Keywords: primal-dual
zbMATH Keywords: approximation algorithm
MaRDI profile type: Publication
full work available at URL: s11590-021-01831-z
OpenAlex ID: W3215399020
cites work: Q3601572
cites work: A note on multicovering with disks
cites work: Fault-tolerant covering problems in metric spaces
cites work: A constant-factor approximation for multi-covering with disks
cites work: Algorithms – ESA 2005
cites work: Clustering to minimize the sum of cluster diameters
cites work: A Greedy Heuristic for the Set-Covering Problem
cites work: Approximation and Online Algorithms
cites work: A 5-approximation algorithm for the \(k\)-prize-collecting Steiner tree problem
cites work: An approximation algorithm for the \(k\)-prize-collecting multicut on a tree problem
cites work: Approximation algorithms for combinatorial problems
cites work: A 4-approximation algorithm for \(k\)-prize collecting Steiner tree problems
cites work: Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks
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: Approximation algorithm for partial positive influence problem in social network
cites work: Breaking thermaxBarrier: Enhanced Approximation Algorithms for Partial Set Multicover Problem
cites work: A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem
cites work: Approximation algorithm for the partial set multi-cover problem
cites work: Improved performance of the greedy algorithm for partial cover
cites work: Q4782696
DOI: 10.1007/S11590-021-01831-Z
description: scientific article; zbMATH DE number 7599793