Uploaded June 2020 | Updated November 2026, 5 hours ago
How to round solutions to the Max-Cut SDP so as to efficiently find graph cuts that are at least 0.878 times the maximum cut. Lecture 20a of "CS Theory Toolkit": a semester-long graduate course on math and CS fundamentals for research in theoretical computer science, taught at Carnegie Mellon University.
Resources for this lecture:
Approximability of CSPs: http://www.cs.cmu.edu/~odonnell/slides/csp-approx.pdf
"Polymorphisms, and how to use them" by Barto, Krokhin, and Willard (for the Dichotomy Conjecture/Theorem. This survey was written *just* before the Algebraic Dichotomy Conjecture was proven.)
Taught by Ryan O'Donnell (https://www.cs.cmu.edu/~odonnell)
Course homepage on CMU's Diderot system: https://www.diderot.one/course/28/
Thumbnail photo by Rebecca Kiger (rebeccakphoto.com/)
How to round solutions to the Max-Cut SDP so as to efficiently find graph cuts that are at least 0.878 times the maximum cut. Lecture 20a of "CS Theory Toolkit": a semester-long graduate course on math and CS fundamentals for research in theoretical computer science, taught at Carnegie Mellon University.
Resources for this lecture:
Approximability of CSPs: http://www.cs.cmu.edu/~odonnell/slides/csp-approx.pdf
"Polymorphisms, and how to use them" by Barto, Krokhin, and Willard (for the Dichotomy Conjecture/Theorem. This survey was written *just* before the Algebraic Dichotomy Conjecture was proven.)
Taught by Ryan O'Donnell (https://www.cs.cmu.edu/~odonnell)
Course homepage on CMU's Diderot system: https://www.diderot.one/course/28/
Thumbnail photo by Rebecca Kiger (rebeccakphoto.com/)










