Computing the Grothendieck constant of some graph classes

Computing the Grothendieck constant of some graph classes

0.00 Avg rating0 Votes
Article ID: iaor201111218
Volume: 39
Issue: 6
Start Page Number: 452
End Page Number: 456
Publication Date: Nov 2011
Journal: Operations Research Letters
Authors: ,
Keywords: cliques
Abstract:

The Grothendieck constant κ ( G ) equ1 of a graph G = ( [ n ] , E ) equ2 is the integrality gap of the canonical semidefinite relaxation of the integer program max x { ± 1 } n Σ i j E w i j x i · x j equ3, replacing ± 1 equ4 variables by unit vectors. We show that κ ( G ) = g / ( g 2 ) cos ( π / g ) 3 / 2 equ5 when G equ6 has no K 5 equ7‐minor and girth g equ8; moreover, κ ( G ) κ ( K k ) equ9 if the cut polytope of G equ10 is defined by inequalities supported by at most k equ11 points; lastly the worst case ratio of clique‐web inequalities is bounded by 3.

Reviews

Required fields are marked *. Your email address will not be published.