Circulation control for faster minimum cost flow in unit-capacity graphs

DOI10.1109/FOCS46700.2020.00018MaRDI QIDQ6944039zbMATH OpenFDO

Authors Aleksander Mądry, Adrian Vladu, Kyriakos Axiotis

Publication date 12 August 2025

Full work available at URL https://doi.org/10.1109/FOCS46700.2020.00018

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Cited in

(6)

• High-accuracy multicommodity flows via iterative refinement
• Electrical flows for polylogarithmic competitive oblivious routing
• Nested dissection meets IPMs: planar min-cost flow in nearly-linear time
• Negative-weight single-source shortest paths in near-linear time
• Maximum flow and minimum-cost flow in almost-linear time
• Parallel, distributed, and quantum exact single-source shortest paths with negative edge weights

This page was built for publication: Circulation control for faster minimum cost flow in unit-capacity graphs

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