Browsing Combinatorics and Optimization by Subject "network flow"
Now showing items 1-1 of 1
-
On Vegh's Strongly Polynomial Algorithm for Generalized Flows
(University of Waterloo, 2014-05-22)This thesis contains an exposition of the new strongly polynomial algorithm for the generalized flow problem by Laszlo Vegh (2013). It has been a long-standing open question whether such an algorithm exists, until it was ...