We prove that there is a randomized polynomial-time algorithm that given...
Hierarchical Clustering is a popular unsupervised machine learning metho...
We introduce general tools for designing efficient private estimation
al...
Consider an agent exploring an unknown graph in search of some goal stat...
We study streaming algorithms for the fundamental geometric problem of
c...
Given a set of n points in d dimensions, the Euclidean k-means problem
(...
Motivated by practical generalizations of the classic k-median and
k-mea...
We study the complexity of the classic capacitated k-median and k-means
...
Given x ∈ (ℝ_≥ 0)^[n]2 recording pairwise
distances, the METRIC VIOLATIO...
Given a complete graph G = (V, E) where each edge is labeled + or -,
the...
The Uncapacitated Facility Location (UFL) problem is one of the most
fun...
We study the private k-median and k-means clustering problem in d
dimens...
Among the various aspects of algorithmic fairness studied in recent year...
Motivated by data analysis and machine learning applications, we conside...
We study several questions related to diversifying search results. We gi...
Correlation clustering is a central problem in unsupervised learning, wi...
Given a set of points in a metric space, the (k,z)-clustering problem
co...
We consider the classic 1-center problem: Given a set P of n points in a...
K-median and k-means are the two most popular objectives for clustering
...
In the non-uniform sparsest cut problem, we are given a supply graph G a...
We present a new local-search algorithm for the k-median clustering
prob...
We consider the numerical taxonomy problem of fitting a positive distanc...
Correlation clustering is a central topic in unsupervised learning, with...
We consider the classic problem of computing the Longest Common Subseque...
The (non-uniform) sparsest cut problem is the following graph-partitioni...
Given a metric space, the (k,z)-clustering problem consists of finding k...
k-means++ <cit.> is a widely used clustering algorithm that is
easy to i...
The k-means objective is arguably the most widely-used cost function for...
Understanding the structure of minor-free metrics, namely shortest path
...
Redistricting is the problem of dividing a state into a number k of
regi...
A classic problem in unsupervised learning and data analysis is to find
...
The Sparsest Cut is a fundamental optimization problem that has been
ext...
We study the problem of online clustering where a clustering algorithm h...
We consider the k-Median problem on planar graphs: given an edge-weighte...
We investigate the fine-grained complexity of approximating the classica...
We consider the classic Facility Location problem on planar graphs
(non-...
We prove essentially tight lower bounds, conditionally to the Exponentia...
In this paper we study lower bounds for the fundamental problem of text
...
We consider the classic Facility Location, k-Median, and k-Means problem...
Motivated by applications in redistricting, we consider the uniform
capa...
Motivated by crowdsourced computation, peer-grading, and recommendation
...
We consider very natural "fence enclosure" problems studied by Capoyleas...
In this paper, we give a conditional lower bound of n^Ω(k) on
running ti...
We consider the popular k-means problem in d-dimensional Euclidean space...
We study online optimization of smoothed piecewise constant functions ov...