Fair Set Cover

The potential harms of algorithmic decisions have ignited algorithmic fairness as a central topic in computer science. One of the fundamental problems in computer science is Set Cover, which has numerous applications with societal impacts, such as assembling a small team of individuals that collectively satisfy a range of expertise requirements. However, despite its broad application spectrum and significant potential impact, set cover has yet to be studied through the lens of fairness.

Authors

Institutions

Publication Details

Published
2025-04-04
DOI
https://doi.org/10.1145/3690624.3709184
Citations
1
Primary Topic
Optimization and Search Problems
Type
article
Field-Weighted Citation Impact
1.49
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Fair Set Cover

Stavros Sintos, Abolfazl Asudeh, Rahul Raychaudhury, Mohsen Dehghankar
1 citations
Optimization and Search Problems
1.49
article

Fair Set Cover

Stavros Sintos, Abolfazl Asudeh, Rahul Raychaudhury, Mohsen Dehghankar
article en
1 citations

Abstract

The potential harms of algorithmic decisions have ignited algorithmic fairness as a central topic in computer science. One of the fundamental problems in computer science is Set Cover, which has numerous applications with societal impacts, such as assembling a small team of individuals that collectively satisfy a range of expertise requirements. However, despite its broad application spectrum and significant potential impact, set cover has yet to be studied through the lens of fairness.

Duke University (US), University of Illinois Chicago (US)
Openalex Percentile: Top 19%
Optimization and Search Problems
1.49
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.