This paper studies the fair range clustering problem in which the data p...
We consider sketching algorithms which first compress data by multiplica...
We provide a new approximation algorithm for the Red-Blue Set Cover prob...
In this paper, we propose a natural notion of individual preference (IP)...
We consider the question of speeding up classic graph algorithms with
ma...
Consider an actor making selection decisions using a series of classifie...
We study the problem of fair k-median where each cluster is required to
...
We introduce the (p,q)-Fair Clustering problem. In this problem, we are
...
We consider the k-clustering problem with ℓ_p-norm cost, which
includes ...
We present an (e^O(p)logℓ/loglogℓ)-approximation
algorithm for socially ...
We study "learning-based" sketching approaches for diverse tasks in nume...
We give a local search based algorithm for k-median (k-means) clustering...
We design a Local Computation Algorithm (LCA) for the set cover problem....
We introduce a "learning-based" algorithm for the low-rank decomposition...
We consider node-weighted survivable network design (SNDP) in planar gra...
The frequencies of the elements in a data stream are an important statis...
A distance matrix A ∈ R^n × m represents all pairwise
distances, A_ij=d(...
A graph spanner is a fundamental graph structure that faithfully preserv...
We study the classic set cover problem from the perspective of sub-linea...
We study the fair variant of the classic k-median problem introduced by
...
We develop a new framework for generalizing approximation algorithms fro...