Approximation algorithm for prize-collecting hypergraph vertex cover with fairness constraints
From MaRDI portal
Cites work
- A linear-time approximation algorithm for the weighted vertex cover problem
- A threshold of ln n for approximating set cover
- A unified approach to approximating partial covering problems
- An approximation algorithm for the \(\boldsymbol{K}\)-prize-collecting multicut problem in trees with submodular penalties
- Analytical approach to parallel repetition
- Approximation algorithm for prize-collecting vertex cover with fairness constraints
- Approximation algorithm for vertex cover with multiple covering constraints
- Approximation algorithms for partial covering problems
- Approximation algorithms for the partition vertex cover problem
- Approximation Algorithms for the Set Covering and Vertex Cover Problems
- scientific article; zbMATH DE number 3616474 (Why is no real title available?)
- Inapproximability of hypergraph vertex cover and applications to scheduling problems
- Inapproximability of Minimum Vertex Cover on k-Uniform k-Partite Hypergraphs
- On colorful vertex and edge cover problems
- On the Equivalence between the Primal-Dual Schema and the Local Ratio Technique
- Reducibility among combinatorial problems
- Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations
- Using homogeneous weights for approximating the partial cover problem
- Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
This page was built for publication: Approximation algorithm for prize-collecting hypergraph vertex cover with fairness constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6866551)
