Approximation algorithm for fair stochastic maximum coverage problem
From MaRDI portal
Cites work
- A kernel search heuristic for a fair facility location problem
- A threshold of ln n for approximating set cover
- Approximating fair clustering with cascaded norm objectives
- Approximation algorithm for prize-collecting vertex cover with fairness constraints
- Approximation algorithm for prize-collecting weighted set cover with fairness constraints
- Approximation algorithm for the stochastic prize-collecting set multicover problem
- Approximation algorithms for maximum weighted target cover problem with distance limitations
- Approximation algorithms for stochastic Boolean function evaluation and stochastic submodular set cover
- Approximation algorithms for the partition vertex cover problem
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Best of both worlds: ex ante and ex post fairness in resource allocation
- Efficient approximation algorithms for maximum coverage with group budget constraints
- Hedging uncertainty: approximation algorithms for stochastic optimization problems
- Maximizing coverage while ensuring fairness: a tale of conflicting objectives
- Maximum coverage problem with group budget constraints
- Minimum power partial cover with fairness constraint
- On colorful vertex and edge cover problems
- On single-source capacitated facility location with cost and fairness objectives
- Pipage rounding: a new method of constructing algorithms with proven performance guarantee
- Stochastic submodular cover with limited adaptivity
- Stochastic vertex cover with few queries
- Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
This page was built for publication: Approximation algorithm for fair stochastic maximum coverage problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6864006)
