Analysis of a Greedy Knapsack Heuristic I

Loading...
From the course by 斯坦福大学
Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
263 ratings
斯坦福大学
263 ratings
Course 4 of 4 in the Specialization Algorithms

Meet the Instructors

  • Tim Roughgarden
    Tim Roughgarden
    Professor
    Computer Science

Explore our Catalog

Join for free and get personalized recommendations, updates and offers.