Proof of Lemma

Loading...
From the course by École normale supérieure
Approximation Algorithms Part II
37 ratings
École normale supérieure

Approximation Algorithms Part II

37 ratings
From the lesson
Maximum Cut and Semi-Definite Programming
We introduce a generalization of linear programming, semi-definite programming.This module uses semi-definite programming to design an approximation algorithm for another basic problem, the maximum cut problem.

Meet the Instructors

  • Claire Mathieu
    Claire Mathieu