Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
Stanford University via Coursera
- Provider Coursera
- Cost Free Online Course (Audit)
- Session In progress
- Language English
- Certificate Paid Certificate Available
- Duration 4 weeks long
- Learn more about MOOCs
Taken this course? Share your experience with other students. Write review

Class Central Custom Lists
Build and share your own catalog of courses with Class Central's custom lists.
Overview
Class Central Tips
Syllabus
-The Bellman-Ford algorithm; all-pairs shortest paths.
Week 2
-NP-complete problems and exact algorithms for them.
Week 3
-Approximation algorithms for NP-complete problems.
Week 4
-Local search algorithms for NP-complete problems; the wider world of algorithms.
Taught by
Tags
Help Center
Most commonly asked questions about Coursera
Reviews for Coursera's Shortest Paths Revisited, NP-Complete Problems and What To Do About Them Based on 0 reviews
- 5 star 0%
- 4 star 0%
- 3 star 0%
- 2 star 0%
- 1 star 0%
Did you take this course? Share your experience with other students.
Write a review