This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: CS 473: Algorithms Chandra Chekuri [email protected] 3228 Siebel Center University of Illinois, UrbanaChampaign Fall 2009 Chekuri CS473ug FordFulkerson Algorithm Correctness and Analysis Polynomial Time Algorithms Part I Algorithm(s) for Maximum Flow Chekuri CS473ug FordFulkerson Algorithm Correctness and Analysis Polynomial Time Algorithms Greedy Approach s v u t 10 20 20 10 30 1 Begin with f ( e ) = 0 for each edge 2 Find a s t path P with f ( e ) < c ( e ) for every edge e ∈ P 3 Augment flow along this path 4 Repeat augmentation for as long as possible. Chekuri CS473ug FordFulkerson Algorithm Correctness and Analysis Polynomial Time Algorithms Greedy Approach s v u t 10/10 20 10/20 10 30 1 Begin with f ( e ) = 0 for each edge 2 Find a s t path P with f ( e ) < c ( e ) for every edge e ∈ P 3 Augment flow along this path 4 Repeat augmentation for as long as possible. Chekuri CS473ug FordFulkerson Algorithm Correctness and Analysis Polynomial Time Algorithms Greedy Approach s v u t 10/10 10/20 10/20 10/10 30 1 Begin with f ( e ) = 0 for each edge 2 Find a s t path P with f ( e ) < c ( e ) for every edge e ∈ P 3 Augment flow along this path 4 Repeat augmentation for as long as possible. Chekuri CS473ug FordFulkerson Algorithm Correctness and Analysis Polynomial Time Algorithms Greedy Approach s v u t 10/10 20/20 20/20 10/10 10/30 1 Begin with f ( e ) = 0 for each edge 2 Find a s t path P with f ( e ) < c ( e ) for every edge e ∈ P 3 Augment flow along this path 4 Repeat augmentation for as long as possible. Chekuri CS473ug FordFulkerson Algorithm Correctness and Analysis Polynomial Time Algorithms Greedy Approach: Issues s v u t 10 20 20 10 30 1 Begin with f ( e ) = 0 for each edge 2 Find a s t path P with f ( e ) < c ( e ) for every edge e ∈ P 3 Augment flow along this path 4 Repeat augmentation for as long as possible. Chekuri CS473ug FordFulkerson Algorithm Correctness and Analysis Polynomial Time Algorithms Greedy Approach: Issues s v u t 10 20/20 20/20 10 20/30 1 Begin with f ( e ) = 0 for each edge 2 Find a s t path P with f ( e ) < c ( e ) for every edge e ∈ P 3 Augment flow along this path 4 Repeat augmentation for as long as possible. Chekuri CS473ug FordFulkerson Algorithm Correctness and Analysis Polynomial Time Algorithms Greedy Approach: Issues s v u t 10 20/20 20/20 10 20/30 1 Begin with f ( e ) = 0 for each edge 2 Find a s t path P with f ( e ) < c ( e ) for every edge e ∈ P 3 Augment flow along this path 4 Repeat augmentation for as long as possible. Greedy can get stuck in suboptimal flow! Chekuri CS473ug FordFulkerson Algorithm Correctness and Analysis Polynomial Time Algorithms Greedy Approach: Issues s v u t 10 20/20 20/20 10 20/30 1 Begin with f ( e ) = 0 for each edge 2 Find a s t path P with f ( e ) < c ( e ) for every edge e ∈ P 3 Augment flow along this path 4 Repeat augmentation for as long as possible....
View
Full Document
 Fall '08
 Chekuri,C
 Algorithms, Graph Theory, Big O notation, Halting problem, FordFulkerson Algorithm, polynomial time

Click to edit the document details