Semidefinite bounds for the stability number of a graph via sums of squares of polynomials

  • Authors:

  • Nebojša Gvozdenović;Monique Laurent

  • Affiliations:

  • Centrum voor Wiskunde en Informatica, Amsterdam, The Netherlands;Centrum voor Wiskunde en Informatica, Amsterdam, The Netherlands

  • Venue:
  • IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Lovász and Schrijver [9] have constructed semidefinite relaxations for the stable set polytope of a graph G = (V,E) by a sequence of lift-and-project operations; their procedure finds the stable set polytope in at most α(G) steps, where α(G) is the stability number of G. Two other hierarchies of semidefinite bounds for the stability number have been proposed by Lasserre [4],[5] and by de Klerk and Pasechnik [3], which are based on relaxing nonnegativity of a polynomial by requiring the existence of a sum of squares decomposition. The hierarchy of Lasserre is known to converge in α(G) steps as it refines the hierarchy of Lovász and Schrijver, and de Klerk and Pasechnik conjecture that their hierarchy also finds the stability number after α(G) steps. We prove this conjecture for graphs with stability number at most 8 and we show that the hierarchy of Lasserre refines the hierarchy of de Klerk and Pasechnik.