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 • 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
