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 …

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 …

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

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 …

In the decremental single-source shortest paths problem, the goal is to maintain distances
from a fixed source s to every vertex v in an m-edge graph undergoing edge deletions. In …

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

Designing dynamic graph algorithms against an adaptive adversary is a major goal in the
field of dynamic graph algorithms. While a few such algorithms are known for spanning …

The minimum st cut problem in graphs is one of the most fundamental problems in
combinatorial optimization, and graph cuts underlie algorithms throughout discrete …

We give an ̃O(m^3/2-1/762\log(U+W)) time algorithm for minimum cost flow with capacities
bounded by U and costs bounded by W. For sparse graphs with general capacities, this is …