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

Por: Coursera . en: , ,

Descripción del Curso

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

Plataforma

Valoraciones

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

Media de valoraciones

0

0 valoraciones

5 1

Detalle

5 Estrellas
0
4 Estrellas
0
3 Estrellas
0
2 Estrellas
0
1 Estrella
0

    Añadir una Valoración

    Nombre
    Email
    Titulo
    Valoración
    Contenido