ConceptTheory & Algos
Goemans-Williamson random Hyperplane rounding
An approximation algorithm for Max-Cut that solves a semidefinite program and partitions the vertices by picking a random hyperplane through the origin.
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.
Lecturers
1Connections
4The lectures that define it or assume it, and the concepts next to it.