A linear programming relaxation

Loading...
Do curso por Escola Normal Superior de Paris
Approximation Algorithms Part II
40 ratings
Escola Normal Superior de Paris
40 ratings
Na lição
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.

Conheça os instrutores

  • Claire Mathieu
    Claire Mathieu