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).
About this Course
Skills you will gain
- 5 stars85.47%
- 4 stars12.73%
- 3 stars1.14%
- 2 stars0.50%
- 1 star0.12%
TOP REVIEWS FROM SHORTEST PATHS REVISITED, NP-COMPLETE PROBLEMS AND WHAT TO DO ABOUT THEM
Great Pace - good examples - always going to the point - clear and providing good information.
Fantastic course by a fantastic Teacher, Prof. Roughgarden manages to turn the dry subject of Algorithms into a hot sexy one!!
Challenging, but does a great job of presenting some important concepts at a high-level and showing where to continue learning.
very interesting course in Algorithms Specialization.
It is sufficient to arouse interest in studying advance algorithm.
Thank you for your teaching, Professor Tim.
About the Algorithms Specialization
Frequently Asked Questions
When will I have access to the lectures and assignments?
What will I get if I subscribe to this Specialization?
Is financial aid available?
More questions? Visit the Learner Help Center.