A simpler and faster strongly polynomial algorithm for generalized flow maximization

DOI10.1145/3055399.3055439zbMath1370.05203arXiv1611.01778OpenAlexW2555036241MaRDI QIDQ4977964

Neil Olver, László A. Végh

Publication date: 17 August 2017

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

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

zbMATH Keywords

network flowstrongly polynomial algorithmgeneralized flowflow maximization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms (68W40) Deterministic network models in operations research (90B10) Graph algorithms (graph-theoretic aspects) (05C85) Flows in graphs (05C21)

Related Items (1)

Iteratively reweighted least squares and slime mold dynamics: connection and convergence

This page was built for publication: A simpler and faster strongly polynomial algorithm for generalized flow maximization