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).
Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
Stanford University
via Coursera
Instructor(s)
Tim Roughgarden
Stanford University
via Coursera
Free (audit)
English
Paid Certificate Available
Approx. 14 hours to complete
Self paced
Intermediate Level
Subtitles: Subtitles: Arabic, French, Portuguese (European), Italian, Vietnamese, German, Russian, English, Spanish