Login / Signup
Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems.
Avrim Blum
Goran Konjevod
R. Ravi
Santosh S. Vempala
Published in:
Theor. Comput. Sci. (2000)
Keyphrases
</>
semidefinite
semidefinite programming
convex relaxation
sufficient conditions
semi infinite
semi definite programming
lower bound
interior point methods
global optimality
special case
optimization problems
combinatorial optimization
solving problems