Internet Archive Scholar

Maximum Flow and Minimum-Cost Flow in Almost-Linear Time [article]

Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva
2022 arXiv   pre-print

Preserved Fulltext

Web Archive Capture PDF (3.4 MB)
https://web.archive.org/web/20220609003049/https://arxiv.org/pdf/2203.00671v2.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL. The file type is application/pdf.

Other Versions

2022 pre-print
arXiv:2203.00671v1 fatcat:z54sixr2drb63a3w7vpdgxtsku
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 m^1+o(1) time. Our algorithm builds the flow through a sequence of m^1+o(1) approximate undirected minimum-ratio cycles, each of which is computed and processed in amortized m^o(1) time using a new dynamic graph data structure. Our framework extends to algorithms running in m^1+o(1) time for computing flows that
more » ... general edge-separable convex functions to high accuracy. This gives almost-linear time algorithms for several problems including entropy-regularized optimal transport, matrix scaling, p-norm flows, and p-norm isotonic regression on arbitrary directed acyclic graphs.
arXiv:2203.00671v2 fatcat:hwdtmht5mjc4fn73pb3zg5tyte
Multiple Versions
Citation

Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva. "Maximum Flow and Minimum-Cost Flow in Almost-Linear Time." arXiv (2022)