Algorithms (II Sem-26)

Topics Covered

• Lecture 1 (18.08, K): Course Outline, Deterministic Median Finding in Linear Time
• Lecture 2 (20.08, K): Discrete Fast Fourier Transform
• Lecture 3 (25.08, K): Karger's Minimum Cut Algorithm
• Lecture 4 (27.08, K): Karger–Stein Algorithm, Introduction to s–t Flows and Cuts

References

• Introduction to Algorithms by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein [CLRS].
• Algorithm Design by Jon Kleinberg and Éva Tardos [KT].
• Randomized Algorithms by Rajeev Motwani and Prabhakar Raghavan [MR].
• Approximation Algorithms by Vijay V. Vazirani [VV].