Faster energy maximization for faster maximum flow

DOI10.1145/3357713.3384247OpenAlexW3034936862MaRDI QIDQ5144966

No author found.

Publication date: 19 January 2021

Published in: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1910.14276

zbMATH Keywords

optimizationgraphsflows

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (9)

Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance ⋮ Unit Capacity Maxflow in Almost $m^{4/3}$ Time ⋮ Some insights on dynamic maintenance of Gomory-Hu tree in cactus graphs and general graphs ⋮ A survey on exact algorithms for the maximum flow and minimum‐cost flow problems ⋮ Minimum cost flow in the CONGEST model ⋮ Brief Announcement: Minimum Cost Maximum Flow in the CONGEST Model ⋮ Brief Announcement: The Laplacian Paradigm in Deterministic Congested Clique ⋮ Unnamed Item ⋮ Electrical flows over spanning trees

This page was built for publication: Faster energy maximization for faster maximum flow