Online Course
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).
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.
-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.
Taught by
Tim Roughgarden
Tags
Related Courses
-
Algorithms
Stanford University
-
NP-Complete Problems
University of California, San Diego
-
Algorithms, Part II
Princeton University
4.8 -
Graph Search, Shortest Paths, and Data Structures
Stanford University
-
Algorithms on Graphs
University of California, San Diego , Higher School of Economics
4.3 -
Algorithm Design and Analysis
University of Pennsylvania
4.0
Reviews
0.0 rating, based on 0 reviews
Never Stop Learning!
