
The authors construct a family of graphs {Hk} whose stable set polytopes require a linear number of iterations of the Lovász-Schrijver SDP operator LS+ to compute, which is the best possible up to a constant factor.


coremsg

graphs-with-stable-set-polytopes-requiring-high-lift-and-project-ranks-for-the-lovász-schrijver-sdp-operator


Graphs with Stable Set Polytopes Requiring High Lift-and-Project Ranks for the Lovász-Schrijver SDP Operator
