ConceptTheory & Algos
Max-cut
A graph optimization problem to find a cut that maximizes the number of edges between the two sets.
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.
Graph theory3Constraint satisfaction problem2Cut in a graph1Cuts1Graph1Integer linear programming1NP-completeness1NP-hardness1
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Ryan O'Donnell
Connections
13The lectures that define it or assume it, and the concepts next to it.
Concepts7
- Constraint satisfaction problem
- Cuts
- Graph
- Goemans-Williamson algorithm
- Majority is Stables theorem
- Moment constraint