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
Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
This course is part of Algorithms Specialization
Instructor: Tim Roughgarden
Access provided by Vishwakarma Intitutes
49,205 already enrolled
Gain insight into a topic and learn the fundamentals.
829 reviews
Intermediate level
Some related experience required
Flexible schedule
1 week at 10 hours a week
Learn at your own pace
94%
Most learners liked this course
Skills you'll gain
Details to know
Shareable certificate
Add to your LinkedIn profile
Assessments
9 assignments
Taught in English
See how employees at top companies are mastering in-demand skills
Build your subject-matter expertise
This course is part of the Algorithms Specialization
When you enroll in this course, you'll also be enrolled in this Specialization.
- 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
The Bellman-Ford algorithm; all-pairs shortest paths.
What's included
14 videos4 readings2 assignments
NP-complete problems and exact algorithms for them.
What's included
11 videos2 readings2 assignments
Approximation algorithms for NP-complete problems.
What's included
6 videos1 reading2 assignments
Local search algorithms for NP-complete problems; the wider world of algorithms.
What's included
11 videos3 readings3 assignments
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
Instructor ratings
(60 ratings)Offered by
Why people choose Coursera for their career
Felipe M.
Learner since 2018
"To be able to take courses at my own pace and rhythm has been an amazing experience. I can learn whenever it fits my schedule and mood."
Jennifer J.
Learner since 2020
"I directly applied the concepts and skills I learned from my courses to an exciting new project at work."
Larry W.
Learner since 2021
"When I need courses on topics that my university doesn't offer, Coursera is one of the best places to go."
Chaitanya A.
"Learning isn't just about being better at your job: it's so much more than that. Coursera allows me to learn without limits."
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
DZ
Reviewed on Feb 15, 2021
Really great and challenging course. Gives a strong foundation in np-complete problems and the approximate methods for making progress on these challenging problems.
AS
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.
KA
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!
Explore more from Computer Science
Stanford University
Stanford University
Stanford University
Birla Institute of Technology & Science, Pilani