ConceptTheory & Algos
Super-increasing Knapsack
A variation of the knapsack problem where each weight is strictly greater than the sum of all preceding weights, allowing it to be solved easily in linear time.
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
1Connections
3The lectures that define it or assume it, and the concepts next to it.