An approximation algorithm for the \(H\)-prize-collecting power cover problem

DOI10.1007/978-3-031-20796-9_7zbMath1528.68406MaRDI QIDQ6166874

Han Dai, Xiaofei Liu, Weidong Li

Publication date: 3 August 2023

Published in: Frontiers of Algorithmic Wisdom (Search for Journal in Brave)

zbMATH Keywords

Lagrangian relaxationapproximation algorithm\(H\)-prize-collectingpower-cover problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80) Approximation algorithms (68W25) Wireless sensor networks as related to computer science (68M18)

Cites Work

• Unnamed Item
• A unified approach to approximating partial covering problems
• Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks
• Approximation algorithms for the multiprocessor scheduling with submodular penalties
• A primal-dual approximation algorithm for the \(k\)-prize-collecting minimum power cover problem
• Combinatorial approximation algorithms for the submodular multicut problem in trees with submodular penalties
• A note on the minimum power partial cover problem on the plane
• A primal-dual algorithm for the minimum partial set multi-cover problem
• Minimum power partial multi-cover on a line
• Approximation algorithms for the minimum power cover problem with submodular/linear penalties
• An approximation algorithm for \(P\)-prize-collecting set cover problem
• Algorithms – ESA 2005
• Approximation and Online Algorithms

This page was built for publication: An approximation algorithm for the \(H\)-prize-collecting power cover problem