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).

Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
Ends soon! Get one of our best deals with Coursera Plus for $199 (usually $399). Save now.

Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
This course is part of Algorithms Specialization

Instructor: Tim Roughgarden
49,515 already enrolled
829 reviews
Details to know

Add to your LinkedIn profile
9 assignments
See how employees at top companies are mastering in-demand skills

Build your subject-matter expertise
- Learn new concepts from industry experts
- Gain a foundational understanding of a subject or tool
- Develop job-relevant skills with hands-on projects
- Earn a shareable career certificate

There are 4 modules in this course
Earn a career certificate
Add this credential to your LinkedIn profile, resume, or CV. Share it on social media and in your performance review.
Instructor

Offered by
Explore more from Algorithms
Status: Free TrialStanford University
Status: Free TrialStanford University
Status: PreviewBirla Institute of Technology & Science, Pilani
Status: Free TrialUniversity of California San Diego
Why people choose Coursera for their career

Felipe M.

Jennifer J.

Larry W.

Chaitanya A.
Learner reviews
- 5 stars
86%
- 4 stars
12.18%
- 3 stars
1.08%
- 2 stars
0.48%
- 1 star
0.24%
Showing 3 of 829
Reviewed on 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.
Reviewed on Mar 15, 2020
A really well-crafted specialization. Has something for everyone from a beginner to an advanced Computer Science student.
Reviewed on Jul 29, 2025
The whole Algorithm course is quite informative. Worthy to review the entire series of videos several times.




