ConceptTheory & Algos
SDP relaxation for max-cut
A semidefinite programming relaxation of the max-cut problem where vertices are represented as unit vectors and edge weights correspond to the dot products of these vectors.
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.