Maximizing coverage while ensuring fairness: a tale of conflicting objectives

DOI10.1007/s00453-022-01072-1OpenAlexW4311846487MaRDI QIDQ2701386

Anastasios Sidiropoulos, Abolfazl Asudeh, Tanya Y. Berger-Wolf, Bhaskar Das Gupta

Publication date: 28 April 2023

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2007.08069

zbMATH Keywords

fairnesscombinatorial optimizationapproximation algorithmsmaximum coverage

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• ``Integer-making theorems
• The hardness of approximation: Gap location
• Discrepancy in different numbers of colors
• On approximation of max-vertex-cover
• Pipage rounding: a new method of constructing algorithms with proven performance guarantee
• Deterministic discrepancy minimization via the multiplicative weight update method
• The maximum vertex coverage problem on bipartite graphs
• Parameterized complexity of Vertex Cover variants
• Approximation Algorithms for Maximization Problems Arising in Graph Partitioning
• Iterative Methods in Combinatorial Optimization
• A threshold of ln n for approximating set cover
• Primal-Dual Schema for Capacitated Covering Problems
• Six Standard Deviations Suffice
• Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds
• Multicolour Discrepancies
• Approximation algorithms for partial covering problems
• Algorithmic Game Theory
• Global Cardinality Constraints Make Approximating Some Max-2-CSPs Harder

This page was built for publication: Maximizing coverage while ensuring fairness: a tale of conflicting objectives