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

Por: Coursera . en: , ,

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.

Plataforma