A linear programming relaxation

From the course by École normale supérieure
Approximation Algorithms Part II
39 ratings
École normale supérieure
39 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