ACM Symposium on Theory of Computing, STOC 2017


Article Details
Title: A simpler and faster strongly polynomial algorithm for generalized flow maximization
Article URLs:
Alternative Article URLs:
Authors: Neil Olver
  • Vrije Universiteit Amsterdam, Department of Econometrics and Operations Research
  • Centrum Wiskunde and Informatica
László A. Végh
  • London School of Economics, Department of Mathematics
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key: conf/stoc/OlverV17
Author Comments:

Discuss this paper and its artifacts below