rounding technique for semidefinite programs.

Uriel Feige Michael Langberg

Published in: J. Algorithms (2006)

Keyphrases

semidefinite
semidefinite programming
linear programming
sufficient conditions
higher dimensional
convex relaxation
interior point methods
approximation algorithms
convex sets
linear programming relaxation
kernel function