Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

Stanford University

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

Stanford University via Coursera

Overview

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.

Taught by

Tim Roughgarden

Reviews

4.8 rating at Coursera based on 803 ratings

Start your review of Shortest Paths Revisited, NP-Complete Problems and What To Do About Them

Never Stop Learning.

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

Someone learning on their laptop while sitting on the floor.