Flows in almost linear time via adaptive preconditioning

DOI10.1145/3313276.3316410zbMath1434.68679arXiv1906.10340OpenAlexW2949083732MaRDI QIDQ5212831

No author found.

Publication date: 30 January 2020

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

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

zbMATH Keywords

convex optimizationpreconditioningnetwork flowsgraph sparsification

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Flows in graphs (05C21)

Related Items

Unit Capacity Maxflow in Almost $m^{4/3}$ Time