We prove a new generalization of the higher-order Cheeger inequality for...
We consider variants of the classic Multiway Cut problem. Multiway Cut a...
We provide a new approximation algorithm for the Red-Blue Set Cover prob...
We give efficient deterministic one-pass streaming algorithms for findin...
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
...
In the Correlation Clustering problem, we are given a complete weighted ...
In the Correlation Clustering problem, we are given a weighted graph G w...
We present an (e^O(p)logℓ/loglogℓ)-approximation
algorithm for socially ...
Learning by demonstration is a versatile and rapid mechanism for transfe...
We introduce and study the notion of an outer bi-Lipschitz extension of ...
Consider an instance of Euclidean k-means or k-medians clustering. We
sh...
When approximating binary similarity using the hamming distance between ...