Semidefinite programming relaxations for graph coloring and maximal clique problems.
Igor DukanovicFranz RendlPublished in: Math. Program. (2007)
Keyphrases
- semidefinite programming
- graph coloring
- semidefinite
- linear programming
- combinatorial problems
- np complete
- quadratically constrained quadratic
- max sat
- primal dual
- maximal cliques
- phase transition
- linear program
- kernel matrix
- optimization problems
- lower bound
- convex relaxation
- reinforcement learning
- machine learning
- data mining