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).
A Dynamic Programming Algorithm for TSP
Loading...
Skills You'll Learn
Data Structure, Algorithms, Np-Completeness, Dynamic Programming
Reviews
4.8 (816 ratings)
- 5 stars85.78%
- 4 stars12.37%
- 3 stars1.10%
- 2 stars0.49%
- 1 star0.24%
ML
Nov 12, 2019
very interesting course in Algorithms Specialization.
It is sufficient to arouse interest in studying advance algorithm.
Thank you for your teaching, Professor Tim.
JE
Dec 27, 2019
I am very confident in the skills I learned. I have read some books on algorithms but this course makes the application so clear regardless of your programing language.
From the lesson
Week 2
NP-complete problems and exact algorithms for them.
Taught By
Tim Roughgarden
Professor