logo-mooc
search-iconsearch-icon
menu-whitemenu-blue
GRATIS
Inicio / Buscador / Ciencias de la Computación / Algoritmos y Estructuras
Stanford University vía Coursera
GRATIS

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

  • money

    Cursos gratis (Auditar)

    question-mark
  • earth

    Inglés

  • folder

    NaN

  • certificate

    Guía de Registro en Coursera

    arrow
VER CURSO arrow
Acerca de este curso

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