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
47,446 already enrolled
(815 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
Recommended if you're interested in Algorithms
École Polytechnique Fédérale de Lausanne
Google Cloud
University of Minnesota
Arizona State University
Why people choose Coursera for their career
Learner reviews
815 reviews
- 5 stars
85.78%
- 4 stars
12.37%
- 3 stars
1.10%
- 2 stars
0.49%
- 1 star
0.24%
Showing 3 of 815
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 Aug 22, 2018
This is the most challenging course in this specialization. Assignments as well as test questions require good amount of thinking.
Reviewed on May 25, 2020
Challenging, but does a great job of presenting some important concepts at a high-level and showing where to continue learning.
New to Algorithms? Start here.
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
Frequently asked questions
Access to lectures and assignments depends on your type of enrollment. If you take a course in audit mode, you will be able to see most course materials for free. To access graded assignments and to earn a Certificate, you will need to purchase the Certificate experience, during or after your audit. If you don't see the audit option:
The course may not offer an audit option. You can try a Free Trial instead, or apply for Financial Aid.
The course may offer 'Full Course, No Certificate' instead. This option lets you see all course materials, submit required assessments, and get a final grade. This also means that you will not be able to purchase a Certificate experience.
When you enroll in the course, you get access to all of the courses in the Specialization, and you earn a certificate when you complete the work. Your electronic Certificate will be added to your Accomplishments page - from there, you can print your Certificate or add it to your LinkedIn profile. If you only want to read and view the course content, you can audit the course for free.
If you subscribed, you get a 7-day free trial during which you can cancel at no penalty. After that, we don’t give refunds, but you can cancel your subscription at any time. See our full refund policy.