lecture 16 - Math 482 (Lecture 16): Max flow and min cut...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Math 482 (Lecture 16): Max flow and min cut This lecture discusses Sections 6.1 and 6.2 of the textbook. * We have studied the primal-dual method and shown how it applies to the shortest path problem. * We will now study the max-flow problem at greater depth. It is efficiently solved by the Ford-Fulkerson algorithm. * Later we will comment on how the Ford-Fulkerson algorithm can be seen from the point of view of primal-dual methods. We have aleady introduced the max flow problem: max v s.t. Af+dv=0, f≤ b, g≥0 where d is defined by d s =-1, d t =1 and d i =0 if i is not s,t. In class exercise: (a) Write this LP out for the wiki problem . (b) In eq (5.21) of the textbook, it is mentioned that one can replace Af+dv=0 with Af+dv≤ 0. Why? Solution: (a) is straightforward and discussed in class. (b): the textbook says "since a deficit in the flow balance at any node implies a surplus at some other". Indeed, convince yourself that it must be an equality in the rows for s and t. Then a strict inequality means some of the goods being flowed are lost at a vertex. But some must be gained elsewhere if at the end "t" receives everything "s" sent. The min cut problem Definition: An s-t cut is a partition (A,B) of the nodes V into A and B such that s A and t B. The capacity of an s-t cut is C(A,B)=Σ b(i,j) where the sum is over all arcs (i,j) with i A and j&isin B. In class exercise: What is the minimum cut in the wiki problem ?
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/19/2012 for the course MATH 482 taught by Professor Staff during the Spring '08 term at University of Illinois, Urbana Champaign.

Page1 / 3

lecture 16 - Math 482 (Lecture 16): Max flow and min cut...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online