This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: 5. Verifying the SPT is correct using the ﬁnal node labels (see reading, hw solutions). 6. Sensitivity of the SPT to changes in edge lengths. • Minimum Spanning Tree Problem 1 1. Problem deﬁnition: undirected graph, requirements for a feasible solution, objective. 2. Properties of trees, cycles, etc. 3. Prim’s Algorithm (running it). 4. Kruskal’s Algorithm (running it). 5. Sensitivity of the MST to changes in edge lengths. • Max Flow Problem 1. Problem deﬁnition: requirements for a feasible solution, objective. 2. The Ford Fulkerson Algorithm (running it). 3. Details and ideas about the residual graph. 4. Using the ﬁnal residual graph to ﬁnd the min cut. 5. Every ﬂow is less than every cut ⇒ Max ﬂow ≤ Min cut. 6. Sensitivity of the Max ﬂow to edge capacities changing. 7. Baseball elimination. 8. Writing problems (like assigning students to advisors) as maxﬂow problems. 2...
View
Full
Document
This note was uploaded on 09/07/2011 for the course OR 1101 taught by Professor Trotter during the Fall '09 term at Cornell.
 Fall '09
 TROTTER

Click to edit the document details