Online Course
Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
- Provider Coursera
- Cost Free Online Course (Audit)
- Session Upcoming
- 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
This course is part of:
Overview
Class Central Tips
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).
Syllabus
Week 1
-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.
-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
Tim Roughgarden
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
Never Stop Learning!
