112 citations · 112 across the 2 of their papers we have counts for
2 papers
cs.DS2024
A Polynomial-Time Approximation for Pairwise Fair -Median Clustering
Sayan Bandyapadhyay, Eden Chlamtáč, Zachary Friggstad +3
In this work, we study pairwise fair clustering with groups, where for every cluster and every group , the number of points in from group mus…
cs.DS2010★ 112 cited
Detecting High Log-Densities -- an O(n^1/4) Approximation for Densest k-Subgraph
Aditya Bhaskara, Moses Charikar, Eden Chlamtac +2
In the Densest k-Subgraph problem, given a graph G and a parameter k, one needs to find a subgraph of G induced on k vertices that contains the largest number of edges. There is a…