1
This is a graduate course on the design and analysis of algorithms, covering several advanced topics not studied in typical introductory courses on algorithms.
FREE
This course includes
Hours of videos
555 years, 6 months
Units & Quizzes
20
Unlimited Lifetime access
Access on mobile app
Certificate of Completion
It is especially designed for doctoral students interested in theoretical computer science.
Course Currilcum
- Fibonacci heaps Unlimited
- Network flows Unlimited
- Maximum flow; minimum cost circulation Unlimited
- Goldberg-Tarjan min-cost circulation algorithm Unlimited
- Cancel-and-tighten algorithm; binary search trees Unlimited
- Splay trees Unlimited
- Dynamic trees (part 1) Unlimited
- Dynamic trees (part 2) Unlimited
- Linear programming (LP) Unlimited
- LP: duality, geometry, simplex Unlimited
- LP: complexity; introduction to the ellipsoid algorithm Unlimited
- LP: ellipsoid algorithm Unlimited
- Conic programming I Unlimited
- Conic programming II Unlimited
- Approximation algorithms Unlimited
- Approximation algorithms (facility location) Unlimited
- Approximation algorithms (max-cut) Unlimited
- Max-cut and sparsest-cut Unlimited
- Convex hulls and fixed dimension LP Unlimited
- Voronoi diagrams Unlimited
