Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
By Coursera
on Coursera
· Technology
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).
Instructor
Shortest Paths Revisited
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.