Computing semidefinite programming lower bounds for the (fractional) chromatic number via block-diagonalization
Recently we investigated in "The operator $\Psi$ for the Chromatic Number of a Graph" hierarchies of semidefinite approximations for the chromatic number $\chi(G)$ of a graph $G$. In particular, we introduced two hierarchies of lower bounds, the `$\psi$'-hierarchy converging to the fractional chromatic number, and the `$\Psi$'-hierarchy converging to the chromatic number of a graph. In both hierarchies the first order bounds are related to the Lov\' asz theta number, while the second order bounds would already be too costly to compute for large graphs. As an alternative, relaxations of the second order bounds are proposed. We present here our experimental results with these relaxed bounds for Hamming graphs, Kneser graphs and DIMACS benchmark graphs. Symmetry reduction plays a crucial role as it permits to compute the bounds using more compact semidefinite programs. In particular, for Hamming and Kneser graphs, we use the explicit block-diagonalization of the Terwilliger algebra given by Schrijver. Our numerical results indicate that the new bounds can be much stronger than the Lov\' asz theta number. For some of the DIMACS instances we improve the best known lower bounds significantly.
|Keywords||Chromatic number, Lovász theta number, semidefinite programming, Terwilliger algebra, Hamming graph, Kneser graph|
|MSC||Coloring of graphs and hypergraphs (msc 05C15), Association schemes, strongly regular graphs (msc 05E30), Semidefinite programming (msc 90C22), Combinatorial optimization (msc 90C27)|
|THEME||Logistics (theme 3)|
|Journal||SIAM Journal on Optimization|
|Project||Semidefinite programming and combinatorial optimization|
Gvozdenovic, N, & Laurent, M. (2008). Computing semidefinite programming lower bounds for the (fractional) chromatic number via block-diagonalization. SIAM Journal on Optimization, 19(02), 592–615.