A New Balancing Method for Solving Parametric Max Flow
March 14, 2007 lecture by Bin Zhang for the Stanford University Computer Systems Colloquium (EE 380). A new, simple and fast algorithm finds a sequence of nested minimum cuts of a bipartite parametric flow network. Instead of working with the original parametric flow-network, the new method works with a derived non-parametric flow network and finds a particular state of the flows in the derived network.EE 380 | Computer Systems Colloquium: http://www.stanford.edu/class/... Computer Systems Laboratory: http://csl.stanford.edu/Stanfo... Center for Professional Development: http://scpd.stanford.edu/Stanf... University Channel on YouTube: http://www.youtube.com/stanfor...
Channel: Education
Uploaded: May 13, 2008 at 11:31 pm
Author: stanforduniversity
Length: 56:38
Rating: N/A
Views: 167
Tags: algorithm application Bin Computer design engineering flow max network parametric programming science software Zhang
Video Comments
|