Maximum Flow and Minimum-Cost Flow in Almost-Linear Time
On 17 Jun, 2022 By admin 0 Comments
April, 2022
Abstract
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 capacities in m1+o(1) time. Our algorithm builds the flow through a sequence of m1+o(1) approximate undirected minimum-ratio cycles, each of which is computed and processed in amortized mo(1) time using a new dynamic graph data structure.