0
(
ratings
)
1
students
Created by:
Last updated:
September 7, 2022
Duration:
Unlimited Duration
FREE
This course includes:
Unlimited Duration
Badge on Completion
Certificate of completion
Unlimited Duration
Description
This is a graduate course on the design and analysis of algorithms, covering several advanced topics not studied in typical introductory courses on algorithms.
It is especially designed for doctoral students interested in theoretical computer science.
Course Curriculum
- 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
About the instructor
5
5
Instructor Rating
1
Reviews
1520
Courses
1916
Students
Massachusetts Institute of Technology
