ConceptTheory & Algos
Partition problem
The problem of partitioning a set of items with weights into two subsets such that the maximum weight of the two subsets is minimized.
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
Given a set of positive integers, decide if there exists a subset whose sum equals the sum of the remaining elements, or equivalently half the total sum.
Connections
7The lectures that define it or assume it, and the concepts next to it.