Minimum power partial cover with fairness constraint

DOI10.1007/978-981-96-4445-2_16MaRDI QIDQ6909239zbMATH OpenFDO

Authors Chensheng Ma, Zhao Zhang

Publication date 29 October 2025

Full work available at URL https://doi.org/10.1007/978-981-96-4445-2_16

zbMATH Keywords

approximation algorithmfairness constraintminimum power coverpartial cover

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites work

• A note on the minimum power partial cover problem on the plane
• A primal-dual algorithm for the minimum power partial cover problem
• A primal-dual approximation algorithm for the \(k\)-prize-collecting minimum power cover problem
• Achieving long-term fairness in submodular maximization through randomization
• An approximation algorithm for the H-prize-collecting power cover problem
• Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks
• Approximation algorithm for partial set multicover versus full set multicover
• Approximation algorithm for prize-collecting vertex cover with fairness constraints
• Approximation algorithms for the minimum power cover problem with submodular/linear penalties
• Approximation algorithms for the minimum power partial cover problem
• Approximation algorithms for the partition vertex cover problem
• Approximation and Online Algorithms
• Group fairness in non-monotone submodular maximization
• scientific article; zbMATH DE number 7064055 (Why is no real title available?)
• Minimum-cost coverage of point sets by disks

Cited in

(1)

• Approximation algorithm for fair stochastic maximum coverage problem

This page was built for publication: Minimum power partial cover with fairness constraint

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6909239)