• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

Computing Semidefinite Programming Lower Bounds for the (Fractional) Chromatic Number Via Block-Diagonalization.

Nebojsa GvozdenovicMonique Laurent
Published in: SIAM J. Optim. (2008)
Keyphrases
  • semidefinite programming
  • lower bound
  • computational complexity
  • upper bound
  • linear programming
  • support vector