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
Build in-demand skills with a full year of Coursera Plus, now $239. Save now.

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

Instructor: Tim Roughgarden
50,549 already enrolled
Included with Learn more
814 reviews
Skills you'll gain
Details to know

Add to your LinkedIn profile
9 assignments
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

Stanford Online

Birla Institute of Technology & Science, Pilani

University of California San Diego
Why people choose Coursera for their career

Felipe M.

Jennifer J.

Larry W.

Chaitanya A.
Learner reviews
- 5 stars
85.95%
- 4 stars
12.24%
- 3 stars
1.08%
- 2 stars
0.48%
- 1 star
0.24%
Showing 3 of 814
Reviewed on Aug 22, 2018
This is the most challenging course in this specialization. Assignments as well as test questions require good amount of thinking. One of the best courses I did on Coursera.
Reviewed on Nov 12, 2019
very interesting course in Algorithms Specialization.It is sufficient to arouse interest in studying advance algorithm.Thank you for your teaching, Professor Tim.
Reviewed on Dec 13, 2019
Great course, great explanation from instructor. I loved how Tim Roughgarden explains algorithms. Course Load was just right for me. Great experience!




