14 citations · 15 across the 3 of their papers we have counts for
3 papers
cs.DS2021
Faster Maxflow via Improved Dynamic Spectral Vertex Sparsifiers
Jan van den Brand, Yu Gao, Arun Jambulapati +4
We make several advances broadly related to the maintenance of electrical flows in weighted graphs undergoing dynamic resistance updates, including: 1. More efficient dynamic spect…
cs.DS2021★ 14 cited
Minimum Cost Flows, MDPs, and -Regression in Nearly Linear Time for Dense Instances
Jan van den Brand, Yin Tat Lee, Yang P. Liu +4
In this paper we provide new randomized algorithms with improved runtimes for solving linear programs with two-sided constraints. In the special case of the minimum cost flow probl…
cs.DS2018★ 1 cited
Coordinate Methods for Accelerating Regression and Faster Approximate Maximum Flow
Aaron Sidford, Kevin Tian
We provide faster algorithms for approximately solving regression, a fundamental problem prevalent in both combinatorial and continuous optimization. In particular,…