Fully dynamic electrical flows: sparse maxflow faster than Goldberg-Rao

DOI10.1109/FOCS52979.2021.00058MaRDI QIDQ6943492zbMATH OpenFDO

Authors Yang P. Liu, Yu Gao, Richard Peng

Publication date 13 August 2025

Full work available at URL https://doi.org/10.1109/FOCS52979.2021.00058

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Proceedings, conferences, collections, etc. pertaining to information and communication theory (94-06)

Cited in

(5)

• High-accuracy multicommodity flows via iterative refinement
• Electrical flows for polylogarithmic competitive oblivious routing
• Interior point methods are not worse than simplex
• Maximum flow and minimum-cost flow in almost-linear time
• Faster min-cost flow and approximate tree decomposition on bounded treewidth graphs

This page was built for publication: Fully dynamic electrical flows: sparse maxflow faster than Goldberg-Rao

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