Home Stanford Shortest Paths Revisited, NP-Complete Problems and What To Do About Them

Shortest Paths Revisited, NP-Complete Problems and What To Do About Them

105
0
Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
Stanford University Online Course Highlights
  • weeks long
  • 4-8 hours a week
  • FREE, Upgradable
  • Self-Paced
  • Taught by: Tim Roughgarden, Professor
  • View Course Syllabus

stanford

Online Course Details:

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).

SKILLS YOU WILL GAIN

  • Data Structure
  • Algorithms
  • Np-Completeness
  • Dynamic Programming

Take This Online Course