Back to Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
Learner Reviews & Feedback for Shortest Paths Revisited, NP-Complete Problems and What To Do About Them by Stanford University
827 ratings
About the Course
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).
Top reviews
TL
Mar 4, 2018
Thanks a lot. It is time consuming, need a lot of thinking and practising to finish the homework. And it is worth taking. After this, we can go deep into cs.
JM
May 25, 2020
Challenging, but does a great job of presenting some important concepts at a high-level and showing where to continue learning.
Filter by: