Back to Courses

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

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

View Course
English
Coursera
Your dream job is just a tap away — only on the BoostGrad app.
View on Boostgrad App
View on Browser
Continue