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).
Этот курс входит в специализацию ''Специализация Алгоритмы'
от партнера
Об этом курсе
Приобретаемые навыки
- Data Structure
- Algorithms
- Np-Completeness
- Dynamic Programming
от партнера

Стэнфордский университет
The Leland Stanford Junior University, commonly referred to as Stanford University or Stanford, is an American private research university located in Stanford, California on an 8,180-acre (3,310 ha) campus near Palo Alto, California, United States.
Программа курса: что вы изучите
Week 1
The Bellman-Ford algorithm; all-pairs shortest paths.
Week 2
NP-complete problems and exact algorithms for them.
Week 3
Approximation algorithms for NP-complete problems.
Week 4
Local search algorithms for NP-complete problems; the wider world of algorithms.
Рецензии
- 5 stars85,23 %
- 4 stars12,95 %
- 3 stars1,16 %
- 2 stars0,51 %
- 1 star0,12 %
Лучшие отзывы о курсе SHORTEST PATHS REVISITED, NP-COMPLETE PROBLEMS AND WHAT TO DO ABOUT THEM
Fantastic course by a fantastic Teacher, Prof. Roughgarden manages to turn the dry subject of Algorithms into a hot sexy one!!
Excellent course! The lectures provide clear and rigorous explanations, and the coding exercises are appropriately challenging.
Nice course, a lot of information in short time. I think is need more time than 4 weeks to finish this course.
Great one for people with advanced understanding! Others will find it slightly hard to follow!
Специализация Алгоритмы: общие сведения
Algorithms are the heart of computer science, and the subject has countless practical applications as well as intellectual depth. This specialization is an introduction to algorithms for learners with at least a little programming experience. The specialization is rigorous but emphasizes the big picture and conceptual understanding over low-level implementation and mathematical details. After completing this specialization, you will be well-positioned to ace your technical interviews and speak fluently about algorithms with other programmers and computer scientists.

Часто задаваемые вопросы
Когда я получу доступ к лекциям и заданиям?
Что я получу, оформив подписку на специализацию?
Можно ли получить финансовую помощь?
Остались вопросы? Посетите Центр поддержки учащихся.