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

Loading...
来自 斯坦福大学 的课程
Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
252 评分
斯坦福大学
252 评分
课程 4(共 4 门,Specialization Algorithms
从本节课中
Week 4
Local search algorithms for NP-complete problems; the wider world of algorithms.

与讲师见面

  • Tim Roughgarden
    Tim Roughgarden
    Professor
    Computer Science