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

This course is part of Algorithms Specialization

Instructor: Tim Roughgarden

Skills you'll gain

  •   Operations Research
  •   Data Structures
  •   Theoretical Computer Science
  •   Design Strategies
  •   Graph Theory
  •   Algorithms
  •   Computational Thinking

    • There are 4 modules in this course

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

    Week 2

    Week 3

    Week 4

    Explore more from Algorithms

    Graph Search, Shortest Paths, and Data Structures

    Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

    Divide and Conquer, Sorting and Searching, and Randomized Algorithms

    Determine Shortest Paths Between Routers Using Python

    ©2025  ementorhub.com. All rights reserved