Approximation algorithm for prize-collecting vertex cover with fairness constraints

DOI10.1007/s10878-024-01215-wMaRDI QIDQ6646739

Mingchao Zhou, Ding-Zhu Du, Zhao Zhang

Publication date: 3 December 2024

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

zbMATH Keywords

approximation algorithmfairness constraintsprize collecting vertex cover

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximation algorithms for the partition vertex cover problem
• Algorithms for covering multiple submodular constraints and applications
• Minimum \(k\)-path vertex cover
• Approximability of capacitated network design
• Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
• Reducibility Among Combinatorial Problems
• Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems
• The prize collecting traveling salesman problem
• On the Computational Complexity of Combinatorial Problems
• Capacitated vertex covering

This page was built for publication: Approximation algorithm for prize-collecting vertex cover with fairness constraints