This is an announcement for the paper "Grothendieck-type inequalities in combinatorial optimization" by Subhash Khot and Assaf Naor. Abstract: We survey connections of the Grothendieck inequality and its variants to combinatorial optimization and computational complexity. Archive classification: cs.DS cs.CC math.CO math.FA Submitted from: naor@cims.nyu.edu The paper may be downloaded from the archive by web browser from URL http://front.math.ucdavis.edu/1108.2464 or http://arXiv.org/abs/1108.2464