Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
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...
By Tim Roughgarden on Coursera
About This 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).
Topics Covered
Frequently Asked Questions
How much does Shortest Paths Revisited, NP-Complete Problems and What To Do About Them cost?
Visit the Shortest Paths Revisited, NP-Complete Problems and What To Do About Them course page for current pricing and available discounts.
Who teaches Shortest Paths Revisited, NP-Complete Problems and What To Do About Them?
Shortest Paths Revisited, NP-Complete Problems and What To Do About Them is taught by Tim Roughgarden, Stanford University.
What skill level is Shortest Paths Revisited, NP-Complete Problems and What To Do About Them for?
This course is designed for advanced learners.
Similar Courses
HTML & CSS Coding for Beginners: Build your own portfolio!
Chris Dixon
Maya for Beginners: Animation
Lucas Ridley
JavaScript for Beginners (includes 6+ real life projects)
Kalob Taulien
Beginner Bootstrap 4: Hand code beautiful responsive websites fast
Chris Dixon