no code implementations • 18 Jan 2021 • Aaron Bernstein, Maximilian Probst Gutenberg, Thatchaphol Saranurak
Our result, in particular, removes the oblivious adversary assumption required by the previous breakthrough result by Henzinger et al. [FOCS'14], which leads to our second result: the first almost-linear time algorithm for $(1-\epsilon)$-approximate min-cost flow in undirected graphs where capacities and costs can be taken over edges and vertices.
Data Structures and Algorithms
no code implementations • 14 Jan 2021 • Jan van den Brand, Yin Tat Lee, Yang P. Liu, Thatchaphol Saranurak, Aaron Sidford, Zhao Song, Di Wang
In the special case of the minimum cost flow problem on $n$-vertex $m$-edge graphs with integer polynomially-bounded costs and capacities we obtain a randomized method which solves the problem in $\tilde{O}(m+n^{1. 5})$ time.
Data Structures and Algorithms Optimization and Control
no code implementations • 5 Sep 2020 • Aaron Bernstein, Maximilian Probst Gutenberg, Thatchaphol Saranurak
We present the first algorithms to break through this barrier: 1) deterministic decremental SSR/SCC with total update time $mn^{2/3 + o(1)}$ 2) deterministic decremental SSSP with total update time $n^{2+2/3+o(1)}$.
Data Structures and Algorithms
1 code implementation • 21 Dec 2018 • Thatchaphol Saranurak, Di Wang
Our result achieve both nearly linear running time and the strong expander guarantee for clusters.
Data Structures and Algorithms
1 code implementation • 15 Feb 2018 • László Kozma, Thatchaphol Saranurak
Through our connection, we transfer all instance-specific lower bounds known for BSTs to a general model of heaps, initiating a theory of dynamic optimality for heaps.
Data Structures and Algorithms Combinatorics
