A Dynamic Programming Heuristic for Knapsack

Loading...
来自 斯坦福大学 的课程
Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
245 评分
斯坦福大学
245 评分
课程 4(共 4 门,Specialization Algorithms

与讲师见面

  • Tim Roughgarden
    Tim Roughgarden
    Professor
    Computer Science