Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
Stanford University via Coursera
Overview
Class Central Tips
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).
Taught by
Tim Roughgarden
Tags
Related Courses
-
Graph Search, Shortest Paths, and Data Structures
Stanford University
-
Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Stanford University
4.7 -
Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
Stanford University
-
Algorithms: Design and Analysis, Part 1
Stanford University
-
Algorithms
Stanford University
-
Algorithms: Design and Analysis, Part 2
Stanford University
Reviews
0.0 rating, based on 0 reviews
Never Stop Learning!
