We give an algorithm that computes exact maximum flows and minimum-cost flows on
directed graphs with m edges and polynomially bounded integral demands, costs, and …

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 …

We give a deterministic m^1+o(1) time algorithm that computes exact maximum flows and
minimum-cost flows on directed graphs with m edges and polynomially bounded integral …

We present an ̃O(m+n^1.5)-time randomized algorithm for maximum cardinality bipartite
matching and related problems (eg transshipment, negative-weight shortest paths, and …

Network flow problems form an important and much‐studied family of combinatorial
optimization problems, with a huge array of practical applications. Two network flow …

We give an algorithm for computing exact maximum flows on graphs with edges and integer
capacities in the range in time. We use to suppress logarithmic factors in. For sparse graphs …

The fastest known LP solver for general (dense) linear programs is due to [Cohen, Lee and
Song'19] and runs in O*(n ω+ n 2.5− α/2+ n 2+ 1/6) time. A number of follow-up works [Lee …

We present an algorithm which given any m-edge directed graph with positive integer
capacities at most U, vertices a and b, and an approximation parameter ϵ∈(0,1) computes …

We present a randomized algorithm that computes single-source shortest paths (SSSP) in
O\left(m\log^8(n)\logW\right) time when edge weights are integral and can be negative. 1 …

We make several advances broadly related to the maintenance of electrical flows in
weighted graphs undergoing dynamic resistance updates, including:(1) More efficient …