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.
VT
May 22, 2024
The test cases posted in the discussion forums were invaluable and saved me time to complete the programming assignments. Thank you for the great course!
Filter by: