Matchings, Flows, and Braess's Paradox [Optional]

Loading...
From the course by Stanford University
Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
155 ratings
Stanford University

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

155 ratings
Course 4 of 4 in the Specialization Algorithms
From the lesson
Week 4
Local search algorithms for NP-complete problems; the wider world of algorithms.

Meet the Instructors

  • Tim Roughgarden
    Tim Roughgarden
    Professor
    Computer Science