22 citations · 57 across the 10 of their papers we have counts for
5 papers · 1 filter
Geometric Median in Nearly Linear Time
Michael B. Cohen, Yin Tat Lee, Gary Miller +2
In this paper we provide faster algorithms for solving the geometric median problem: given points in compute a point that minimizes the sum of Euclidean distan…
Analysis of Resparsification
Jakub Pachocki
We show that schemes for sparsifying matrices based on iteratively resampling rows yield guarantees matching classic 'offline' sparsifiers (see e.g. Spielman and Srivastava [STOC 2…
Online Row Sampling
Michael B. Cohen, Cameron Musco, Jakub Pachocki
Finding a small spectral approximation for a tall matrix is a fundamental numerical primitive. For a number of reasons, one often seeks an approximation whose rows…
Routing under Balance
Alina Ene, Gary Miller, Jakub Pachocki +1
We introduce the notion of balance for directed graphs: a weighted directed graph is -balanced if for every cut , the total weight of edges going from to $V\s…
Tight Lower Bounds on Graph Embedding Problems
Marek Cygan, Fedor V. Fomin, Alexander Golovnev +4
We prove that unless the Exponential Time Hypothesis (ETH) fails, deciding if there is a homomorphism from graph to graph cannot be done in time . We al…