A quadratic programming relaxation

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

Explore our Catalog

Join for free and get personalized recommendations, updates and offers.