A simpler and faster strongly polynomial algorithm for generalized flow maximization (2017)
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/3055399.3055439
Publication URI: http://dx.doi.org/10.1145/3055399.3055439
Type: Conference/Paper/Proceeding/Abstract