327 citations · 563 across the 39 of their papers we have counts for
Showing 2020 · cs.DSShow all
2 papers · 2 filters
cs.DS2020★ 22 cited
Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint
Georgios Amanatidis, Federico Fusco, Philip Lazos +2
Constrained submodular maximization problems encompass a wide variety of applications, including personalized recommendation, team formation, and revenue maximization via viral mar…
cs.DS2020★ 6 cited
Fair Clustering with Multiple Colors
Matteo Böhm, Adriano Fazzone, Stefano Leonardi +1
A fair clustering instance is given a data set in which every point is assigned some color. Colors correspond to various protected attributes such as sex, ethnicity, or age. A…