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
This course is part of Algorithms Specialization

Instructor: Tim Roughgarden
Access provided by New York State Department of Labor
47,973 already enrolled
(821 reviews)
Skills you'll gain
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


Earn a career certificate
Add this credential to your LinkedIn profile, resume, or CV
Share it on social media and in your performance review

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
Instructor

Offered by
Why people choose Coursera for their career




Learner reviews
821 reviews
- 5 stars
85.88%
- 4 stars
12.28%
- 3 stars
1.09%
- 2 stars
0.48%
- 1 star
0.24%
Showing 3 of 821
Reviewed on Jan 14, 2018
I love Tim's excitement for algorithms. He really stands out as a quality teacher in his selection of content, explanations and enthusiasm.
Reviewed on Dec 1, 2019
Great course in general, got the chance to dive a little deeper into the world of computer science.
Reviewed on Aug 23, 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.
Recommended if you're interested in Computer Science
Stanford University
Stanford University
Stanford University
Coursera Project Network

Open new doors with Coursera Plus
Unlimited access to 10,000+ world-class courses, hands-on projects, and job-ready certificate programs - all included in your subscription
Advance your career with an online degree
Earn a degree from world-class universities - 100% online
Join over 3,400 global companies that choose Coursera for Business
Upskill your employees to excel in the digital economy