Description

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

Price: Enroll For Free!

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