2017-06-19
A simpler and faster strongly polynomial algorithm for generalized flow maximization
Publication
Publication
Presented at the
Annual ACM Symposium on Theory of Computing (June 2017), Montreal
Additional Metadata | |
---|---|
, , | |
doi.org/10.1145/3055399.3055439 | |
Annual ACM Symposium on Theory of Computing | |
Organisation | Centrum Wiskunde & Informatica, Amsterdam (CWI), The Netherlands |
Olver, N., & Végh, L. (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 |