A simpler and faster strongly polynomial algorithm for generalized flow maximization

Additional Metadata
Keywords	Generalized flow, Network flow, Strongly polynomial
Persistent URL	doi.org/10.1145/3055399.3055439
Conference	Annual ACM Symposium on Theory of Computing
Organisation	Centrum Wiskunde & Informatica, Amsterdam (CWI), The Netherlands
Citation APA APA Style APA-ALL Style AAA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	Olver, N.& Végh, L. (2017). A simpler and faster strongly polynomial algorithm for generalized flow maximization. Proceedings of the Annual ACM Symposium on Theory of Computing, 100–111.https://doi.org/10.1145/3055399.3055439

Publication