A new approach to computing maximum flows using electrical flows
From MaRDI portal
Publication:5495846
DOI10.1145/2488608.2488704zbMath1293.05148OpenAlexW2009281933MaRDI QIDQ5495846
No author found.
Publication date: 7 August 2014
Published in: Proceedings of the forty-fifth annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2488608.2488704
Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Flows in graphs (05C21)
Related Items (11)
Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance ⋮ Lower Bounds for Parallel and Randomized Convex Optimization ⋮ Unit Capacity Maxflow in Almost $m^{4/3}$ Time ⋮ Accelerated Extra-Gradient Descent: A Novel Accelerated First-Order Method ⋮ The Approximate Duality Gap Technique: A Unified Theory of First-Order Methods ⋮ Efficient Convex Optimization with Oracles ⋮ Unnamed Item ⋮ Exact and approximation algorithms for weighted matroid intersection ⋮ Linear Coupling: An Ultimate Unification of Gradient and Mirror Descent ⋮ Fast Augmenting Paths by Random Sampling from Residual Graphs ⋮ Generalized Momentum-Based Methods: A Hamiltonian Perspective
This page was built for publication: A new approach to computing maximum flows using electrical flows
