133 citations · 389 across the 37 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2023★ 3 cited
A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow
Jan van den Brand, Li Chen, Rasmus Kyng +5
We give a deterministic time algorithm that computes exact maximum flows and minimum-cost flows on directed graphs with edges and polynomially bounded integral dem…
cs.DS2023★ 2 cited
Sparsifying sums of norms
Arun Jambulapati, James R. Lee, Yang P. Liu +1
For any norms on and , we show there is a sparsified norm such that…
cs.DS2022
Dynamic Maxflow via Dynamic Interior Point Methods
Jan van den Brand, Yang P. Liu, Aaron Sidford
In this paper we provide an algorithm for maintaining a -approximate maximum flow in a dynamic, capacitated graph undergoing edge additions. Over a sequence of -additions…