A Simpler and Faster Strongly Polynomial Algorithm for Generalized Flow Maximization

DOI10.1145/3383454zbMath1494.90122OpenAlexW3021764208MaRDI QIDQ5133966

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

Publication date: 11 November 2020

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/26543

zbMATH Keywords

network flowstrongly polynomialgeneralized flow

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms (68W40)

Related Items (1)

A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix

This page was built for publication: A Simpler and Faster Strongly Polynomial Algorithm for Generalized Flow Maximization