research
∙
07/02/2022
Exponential Convergence of Sinkhorn Under Regularization Scheduling
The optimal transport (OT) problem or earth mover's distance has wide ap...
share
research
∙
07/15/2020
Vertex Sparsification for Edge Connectivity
Graph compression or sparsification is a basic information-theoretic and...
research
∙
10/17/2019
A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond
We consider the classical Minimum Balanced Cut problem: given a graph G,...
research
∙
05/23/2018
Incomplete Nested Dissection
We present an asymptotically faster algorithm for solving linear systems...
research
∙
10/20/2014
