We study the problem of explainable clustering in the setting first
form...
Given a metric space (F ∪ C, d), we consider star covers of C with
balan...
We consider the maximum bipartite matching problem in stochastic setting...
The online matching problem was introduced by Karp, Vazirani and Vaziran...
We design a generic method for reducing the task of finding weighted
mat...
We study k-means clustering in a semi-supervised setting. Given an oracl...