Semi-Definite Relaxations for Minimum Bandwidth and other Vertex-Ordering Problems.

Avrim Blum Goran Konjevod R. Ravi Santosh S. Vempala

Published in: STOC (1998)

Keyphrases

semidefinite
convex relaxation
semidefinite programming
semi infinite
optimization problems
semi definite programming
lower bound
sufficient conditions
convex optimization
globally optimal
interior point methods
higher dimensional
learning algorithm
feature extraction
dynamic programming
model selection