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

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

Stanford University via Coursera

students interested
  • Provider Coursera
  • Subject Algorithms and Data Structures
  • $ Cost Free Online Course (Audit)
  • Session In progress
  • Language English
  • Certificate Paid Certificate Available
  • Start Date
  • Duration 4 weeks long

Taken this course? Share your experience with other students. Write review

Overview

Sign up to Coursera courses for free Learn how

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

Help Center

Most commonly asked questions about Coursera Coursera

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

  • 5 star 0%
  • 4 star 0%
  • 3 star 0%
  • 2 star 0%
  • 1 star 0%

Did you take this course? Share your experience with other students.

Write a review

Class Central

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

Sign up for free

Never stop learning Never Stop Learning!

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