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

Course Reviews

N.A.

ratings
  • 5 stars0
  • 4 stars0
  • 3 stars0
  • 2 stars0
  • 1 stars0

No Reviews found for this course.

HACER ESTE CURSO IR AL CURSO

*Irás a la plataforma donde se impartirá el mooc y donde podrás registrarte

  • GRATIS
  • 20-03-2017FECHA INICIO
  • Stanford University
  • Tim Roughgarden

Profesores

ALUMNOS MATRICULADOS