research
∙
06/30/2021
Nearly-Tight and Oblivious Algorithms for Explainable Clustering
We study the problem of explainable clustering in the setting first form...
share
research
∙
12/03/2019
Approximating Star Cover Problems
Given a metric space (F ∪ C, d), we consider star covers of C with balan...
research
∙
09/27/2019
Beating Greedy for Stochastic Bipartite Matching
We consider the maximum bipartite matching problem in stochastic setting...
research
∙
04/17/2019
Online Matching with General Arrivals
The online matching problem was introduced by Karp, Vazirani and Vaziran...
research
∙
11/07/2018
Weighted Matchings via Unweighted Augmentations
We design a generic method for reducing the task of finding weighted mat...
research
∙
03/02/2018