Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
The primary topics in this part of the specialization are: shortest paths (Bellman-Ford, Floyd-Warshall, Johnson), NP-completeness and what it means for the algorithm designer, and strategies for coping with computationally intractable problems (analysis of heuristics, local search).
Who Should Enroll
Learners with at least a little bit of programming experience who want to learn the essentials of algorithms. In a University computer science curriculum, this course is typically taken in the third year.
Time Commitment
4 weeks of study, 4-8 hours/week
Instructor
Tim Roughgarden, Professor of Computer Science
