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

Institution Logo

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).

Taught by

Tim Roughgarden

Related Courses

Reviews

0.0 rating, based on 0 reviews

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

Never stop learning Never Stop Learning!

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

Sign up for free