subject

Coursera: Shortest Paths Revisited, NP-Complete Problems and What To Do About Them

 with  Tim Roughgarden
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).

Syllabus

Week 1
The Bellman-Ford algorithm; all-pairs shortest paths.

Week 2
NP-complete problems and exact algorithms for them.

Week 3
Approximation algorithms for NP-complete problems.

Week 4
Local search algorithms for NP-complete problems; the wider world of algorithms.

0 Student
reviews
Cost Free Online Course (Audit)
Institution Stanford University
Provider Coursera
Language English
Certificates Paid Certificate Available
Calendar 4 weeks long
Sign up for free? Learn how

Disclosure: To support our site, Class Central may be compensated by some course providers.

+ Add to My Courses
FAQ View All
What are MOOCs?
MOOCs stand for Massive Open Online Courses. These are free online courses from universities around the world (eg. Stanford Harvard MIT) offered to anyone with an internet connection.
How do I register?
To register for a course, click on "Go to Class" button on the course page. This will take you to the providers website where you can register for the course.
How do these MOOCs or free online courses work?
MOOCs are designed for an online audience, teaching primarily through short (5-20 min.) pre recorded video lectures, that you watch on weekly schedule when convenient for you.  They also have student discussion forums, homework/assignments, and online quizzes or exams.

0 reviews for Coursera's Shortest Paths Revisited, NP-Complete Problems and What To Do About Them

Write a review

Class Central

Get personalized course recommendations, track subjects and courses with reminders, and more.

Sign up for free