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

Loading...
来自 Stanford University 的课程
Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
298 个评分
Stanford University
298 个评分
课程 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

探索我们的目录

免费加入并获得个性化推荐、更新和优惠。