Additional Metadata
Keywords Generalized flow, Network flow, Strongly polynomial
Persistent URL dx.doi.org/10.1145/3055399.3055439
Conference Annual ACM Symposium on Theory of Computing
Citation
Olver, N.K, & Végh, L.A. (2017). A simpler and faster strongly polynomial algorithm for generalized flow maximization. In Proceedings of the Annual ACM Symposium on Theory of Computing (pp. 100–111). doi:10.1145/3055399.3055439