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

Shortest Paths Revisited, NP-Complete Problems and What To Do About Them (Coursera)
Course Auditing
Categories
Effort
Certification
Languages
Misc

MOOC List is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

Shortest Paths Revisited, NP-Complete Problems and What To Do About Them (Coursera)
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).

Class Deals by MOOC List - Click here and see Coursera's Active Discounts, Deals, and Promo Codes.

MOOC List is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

Course 4 of 4 in the Algorithms Specialization.


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.



1
Average: 1 ( 3 votes )

MOOC List is learner-supported. When you buy through links on our site, we may earn an affiliate commission.