Course Overview, Interval Scheduling
1:23:34Divide & Conquer: Convex Hull, Median Finding
1:20:34R1. Matrix Multiplication and the Master Theorem
53:46Divide & Conquer: FFT
1:20:52R2. 2-3 Trees and B-Trees
30:45Divide & Conquer: van Emde Boas Trees
1:20:14Amortization: Amortized Analysis
1:15:53Randomization: Matrix Multiply, Quicksort
1:21:52Randomization: Skip Lists
1:20:56Randomization: Universal & Perfect Hashing
1:21:51Augmentation: Range Trees
1:24:34Dynamic Programming: Advanced DP
1:20:08Dynamic Programming: All-Pairs Shortest Paths
1:21:49Greedy Algorithms: Minimum Spanning Tree
1:22:10Incremental Improvement: Max Flow, Min Cut
1:22:58Incremental Improvement: Matching
1:22:32Linear Programming: LP, Reductions, Simplex
1:22:27Complexity: P, NP, NP-completeness, Reductions
1:25:25Incremental Improvement: Max Flow, Min Cut
This lecture introduces network flow problems, focusing on the Max Flow-Min Cut theorem and its implications for finding maximum throughput. The Ford-Fulkerson algorithm is explored in detail.
MIT 6.046J Design and Analysis of Algorithms, Spring 2015
View the complete course: http://ocw.mit.edu/6-046JS15
Instructor: Srinivas Devadas
Greedy Algorithms: Minimum Spanning Tree
Next · Lecture 16Incremental Improvement: Matching