Maximizing coverage while ensuring fairness: a tale of conflicting objectives
From MaRDI portal
Cites work
- ``Integer-making theorems
- A threshold of ln n for approximating set cover
- Algorithmic Game Theory
- An FPT algorithm beating 2-approximation for \(k\)-cut
- Approximation algorithms for maximization problems arising in graph partitioning
- Approximation algorithms for partial covering problems
- Deterministic discrepancy minimization via the multiplicative weight update method
- Discrepancy in different numbers of colors
- Global Cardinality Constraints Make Approximating Some Max-2-CSPs Harder
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1528185 (Why is no real title available?)
- scientific article; zbMATH DE number 819814 (Why is no real title available?)
- scientific article; zbMATH DE number 1418265 (Why is no real title available?)
- scientific article; zbMATH DE number 1445293 (Why is no real title available?)
- Inapproximability of vertex cover and independent set in bounded degree graphs
- Iterative methods in combinatorial optimization.
- Maximizing submodular set functions subject to multiple linear constraints
- Multicolour Discrepancies
- On approximation of max-vertex-cover
- Parameterized complexity of Vertex Cover variants
- Pipage rounding: a new method of constructing algorithms with proven performance guarantee
- Primal-Dual Schema for Capacitated Covering Problems
- Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds
- Six Standard Deviations Suffice
- The hardness of approximation: Gap location
- The maximum vertex coverage problem on bipartite graphs
Cited in
(2)
This page was built for publication: Maximizing coverage while ensuring fairness: a tale of conflicting objectives
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2701386)
