Free Online Course: Shortest Paths Revisited, NP-Complete Problems and What To Do About Them provided by Coursera is a comprehensive online course, which lasts for 4 weeks long, 14 hours worth of material. The course is taught in English and is free of charge. Upon completion of the course, you can receive an e-certificate from Coursera. Shortest Paths Revisited, NP-Complete Problems and What To Do About Them is taught by Tim Roughgarden.
4 weeks long, 14 hours worth of material
Upcoming
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).
