Diverse data selection under fairness constraints

DOI10.4230/LIPICS.ICDT.2021.13MaRDI QIDQ7229586zbMATH OpenFDO

Authors Zafeiria Moumoulidou, Andrew McGregor, Alexandra Meliou

Publication date 16 April 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ICDT.2021.13

zbMATH Keywords

approximation algorithmsdata selectiondiversity maximizationfairness constraints

Mathematics Subject Classification ID

Database theory (68P15)

Cites work

• Approximation algorithms for dispersion problems
• Approximation algorithms for maximum dispersion
• Clustering to minimize the maximum intercluster distance
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Fairness through awareness
• Heuristic and Special Case Algorithms for Dispersion Problems
• Local Search for Max-Sum Diversification
• Matroid and knapsack center problems
• Max flows in O(nm) time, or better
• Max-sum diversification, monotone submodular functions, and dynamic updates
• Obnoxious Facility Location on Graphs
• Randomized and Approximation Algorithms for Blue-Red Matching
• The discrete p-dispersion problem

Cited in

(1)

• Fast exact algorithms for the maximum diversity problem

This page was built for publication: Diverse data selection under fairness constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7229586)