- From www.coursera.org
Shortest Paths Revisited, NP-Complete Problems and What To Do About Them

- Self-paced
- Free Access
- Fee-based Certificate
- 4 Sequences
- Intermediate Level
Course details
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.
Prerequisite
Instructors
Tim Roughgarden
Professor
Computer Science
Editor
Leland Stanford Junior University, better known as Stanford University, is a private American university located in Silicon Valley, south of San Francisco.
Its motto is "Die Luft der Freiheit weht", which means "The wind of freedom blows".
Ranked among the world's top universities in most international rankings, it enjoys great prestige.

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.
