Course Kingdom

- Course -

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



Algorithms

12 August, 2021

The primary topics in this part of the specializat...

$89.00 FREE

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


Join us on Telegram



Join our Udemy Courses Telegram Channel



Enroll Now

Subscribe us on Youtube