ConceptTheory & Algos
Knapsack problem
A problem of finding a subset of weights that sums to a particular target sum, which is NP-complete in its general form.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
2Each in their own terms, from the easiest level.
Erik Demaine
A problem where you must select a subset of items, each with a size and value, to maximize total value without exceeding a total capacity.
Connections
6The lectures that define it or assume it, and the concepts next to it.