58 citations · 72 across the 4 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.DS2019
Generalized Assignment via Submodular Optimization with Reserved Capacity
Ariel Kulik, Kanthi Sarpatwar, Baruch Schieber +1
We study a variant of the \emph{generalized assignment problem} ({\sf GAP}) with group constraints. An instance of {\sf Group GAP} is a set of items, partitioned into group…
cs.DS2019★ 58 cited
Scalable Fair Clustering
Arturs Backurs, Piotr Indyk, Krzysztof Onak +3
We study the fair variant of the classic -median problem introduced by Chierichetti et al. [2017]. In the standard -median problem, given an input pointset , the goal is t…