E0 225 Design and Analysis of Algorithms
Dr T.Kavitha
Topics covered
- Max-flow algorithms
- Ford Fulkerson algorithm
- Dinic's algorithm
- Preflow-push algorithm
- Geometric algorithms
- 2-dimensional linear prog.
- Planar point location
- Algebric algorithms
- Primality testing
- Polynomial multiplication
- Randomized algorithms
- All pairs shortest path
- Min-Cut
- String matching
- NP-completeness
- Approximation algorithms
Texts and references
- Cormen, T.H., Leiserson, C.E. and Rivest, R.L., Introduction to Algorithms, MIT Press
- R. Motwani, P. Raghavan, Randomized Algorithms, Cambridge University Press
- Mark de Berg, Marc Van Kreveld, Mark Overmars, Otfried Schwarzkopf, Computational Geometry: Algorithms and Applications, Springer
- someother's course page
- Manindra Agrawal, Neeraj Kayal, Nitin Saxena, Primes is in P
Assignments (zero-weightage)
Exams