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

Loading...
來自 Stanford University 的課程
Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
363 個評分
Stanford University
363 個評分
課程 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

探索我們的目錄

免費加入並獲得個性化推薦、更新和優惠。