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).
Ananysis of Dynamic Programming Heuristic
Loading...
Получаемые навыки
Data Structure, Algorithms, Np-Completeness, Dynamic Programming
Рецензии
4.8 (оценок: 766)
- 5 stars85,11 %
- 4 stars13,05 %
- 3 stars1,17 %
- 2 stars0,52 %
- 1 star0,13 %
ML
12 нояб. 2019 г.
very interesting course in Algorithms Specialization.\n\nIt is sufficient to arouse interest in studying advance algorithm.\n\nThank you for your teaching, Professor Tim.
JE
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.
Из урока
Week 3
Approximation algorithms for NP-complete problems.
Преподаватели
Tim Roughgarden
Professor
Ознакомьтесь с нашим каталогом
Присоединяйтесь бесплатно и получайте персонализированные рекомендации, обновления и предложения.
Coursera Footer
© Coursera Inc., 2022 Все права защищены.
