Sign inSign in

Max-cut

A graph optimization problem to find a cut that maximizes the number of edges between the two sets.
as Ryan O'Donnell defines itCarnegie Mellon UniversityThe wording closest to all 6 definitions
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.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

1
  • Ryan O'Donnell

    Carnegie Mellon University · Undergraduate

    • 12:30Constraint Satisfaction Problems
    • 26:13CSP Approximability: Optimization and Certification
    • 10:01k-wise Independent Generators
    • 0:40The Semidefinite Programming Relaxation for Max-Cut
    • 0:15Majority Is Stablest Theorem

Connections

13

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

1 lecturer. 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.