Welcome and Overview University of Washington欢迎和概述华盛顿大学.pptVIP

* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * Ford-Fulkerson Algorithm (1956) while not done Construct residual graph GR Find an s-t path P in GR with capacity b 0 Add b units along in G If the sum of the capacities of edges leaving S is at most C, then the algorithm takes at most C iterations July 3, 2008 * IUCEE: Algorithms MaxFlow – MinCut Theorem There exists a flow which has the same value of the minimum cut Proof: Consider a flow where the residual graph has no s-t path with positive capacity Let S be the set of vertices in GR reachable from s with paths of positive capacity s t July 3, 2008 * IUCEE: Algorithms Network Flow Applications Applications of network flow are very powerful Problems that look very unlike flow can be converted to network flow Brings up the theme of problem mapping July 3, 2008 IUCEE: Algorithms * Problem Reduction Reduce Problem A to Problem B Convert an instance of Problem A to an instance Problem B Use a solution of Problem B to get a solution to Problem A Practical Use a program for Problem B to solve Problem A Theoretical Show that Problem B is at least as hard as Problem A July 3, 2008 * IUCEE: Algorithms Bipartite Matching A graph G=(V,E) is bipartite if the vertices can be partitioned into disjoints sets X,Y A matching M is a subset of the edges that does not share any vertices Find a matching as large as possible July 3, 2008 * IUCEE: Algorithms Converting Matching to Network Flow t s July 3, 2008 * IUCEE: Algorithms Open Pit Mining Each unit of earth has a profit (possibly negative) Getting to the ore below the surface requires removing the dirt above Test drilling gives reasonable estimates of costs Plan an optimal mining operation July 3, 2008 * IUCEE: Algorithms Mine Graph -3 -10 -4 3 -2 -3 -1 8 -2 4 3 -1 -7 -10 -1 July 3, 2008 * IUCEE: Algorithms Setting the costs If p(v) 0, cap(v,t) = p(v) c