ConceptTheory & Algos
Goemans-Williamson SDP rounding algorithm
An approximation algorithm for Max-Cut that solves a semidefinite program and rounds the resulting vectors using a random hyperplane.
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
3The lectures that define it or assume it, and the concepts next to it.