lecture25

lecture25 - IE170: Algorithms in Systems Engineering:...

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

View Full Document Right Arrow Icon

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

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

Unformatted text preview: IE170: Algorithms in Systems Engineering: Lecture 25 Jeff Linderoth Department of Industrial and Systems Engineering Lehigh University March 30, 2007 Jeff Linderoth (Lehigh University) IE170:Lecture 25 Lecture Notes 1 / 23 Taking Stock Last Time Flows This Time (Cardinality) Matching Homework and Review Jeff Linderoth (Lehigh University) IE170:Lecture 25 Lecture Notes 2 / 23 Flows The Big Kahuna Max-Flow Min-Cut Theorem The following statements are equivalent 1 f is a maximum flow 2 f admits no augmenting path. (No ( s,t ) path in residual network) 3 | f | = c ( S,T ) for some cut ( S,T ) Jeff Linderoth (Lehigh University) IE170:Lecture 25 Lecture Notes 3 / 23 Flows Ford-Fulkerson Algorithm This gave Lester Ford and Del Fulkerson an idea to find he maximum flow in a network: Ford-Fulkerson ( V,E,c,s,t ) 1 for i 1 to n 2 do f [ u,v ] f [ v,u ] 3 while augmenting path P in G f 4 do augment f by c f ( P ) Assume all capacities are integers. If they are rational numbers, scale them to be integers. Jeff Linderoth (Lehigh University) IE170:Lecture 25 Lecture Notes 4 / 23 Flows Analysis If the maximum flow is | f | * , then (since the augmenting path must raise the flow by at least 1 on each iteration), we will require | f | * iterations. Augmenting the flow takes O ( | E | ) Ford-Fulkerson runs in O ( | f | * | E | ) This is not polynomial in the size of the input....
View Full Document

Page1 / 4

lecture25 - IE170: Algorithms in Systems Engineering:...

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

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