Sign inSign in

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.
Watch it explained

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.

NP-completeness2Subset2Integer sums1Weights and sums1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

2

Each in their own terms, from the easiest level.

  • Erik Demaine

    MIT · Undergraduate

    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.
    • 1:10:19Complexity: P, NP, NP-completeness, Reductions

Connections

7

The lectures that define it or assume it, and the concepts next to it.

2 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.