A deterministic almost-linear time algorithm for minimum-cost flow

DOI10.1109/FOCS57990.2023.00037MaRDI QIDQ6942935zbMATH OpenFDO

Authors Jan van Den Brand, Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva, Aaron Sidford

Publication date 15 August 2025

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Flows in graphs (05C21)

This page was built for publication: A deterministic almost-linear time algorithm for minimum-cost flow

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6942935)