Key information
About the content
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).
Syllabus
- Week 1 - Week 1
The Bellman-Ford algorithm; all-pairs shortest paths. - Week 2 - Week 2
NP-complete problems and exact algorithms for them. - Week 3 - Week 3
Approximation algorithms for NP-complete problems. - Week 4 - Week 4
Local search algorithms for NP-complete problems; the wider world of algorithms.
Intructors
Tim Roughgarden
Professor
Computer Science
Content designer
Platform
Coursera is a digital company offering massive open online course founded by computer teachers Andrew Ng and Daphne Koller Stanford University, located in Mountain View, California.
Coursera works with top universities and organizations to make some of their courses available online, and offers courses in many subjects, including: physics, engineering, humanities, medicine, biology, social sciences, mathematics, business, computer science, digital marketing, data science, and other subjects.
