A Simpler and Faster Strongly Polynomial Algorithm for Generalized Flow Maximization (2020)

First Author: Olver N
Attributed to:  New strongly polynomial algorithms for network optimisation problems funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1145/3383454

Publication URI: http://dx.doi.org/10.1145/3383454

Type: Journal Article/Review

Parent Publication: Journal of the ACM

Issue: 2