SDP Gaps for 2-to-1 and Other Label-Cover Variants

Abstract

Abstract. In this paper we present semidefinite programming (SDP) gap instances for the following variants of the Label-Cover problem, closely related to the Unique Games Conjecture: (i) 2-to-1 Label-Cover; (ii) 2-to-2 Label-Cover; (iii) α-constraint Label-Cover. All of our gap instances have perfect SDP solutions. For alphabet size K, the integral optimal solutions have value:Prior to this work, there were no known SDP gap instances for any of these problems with perfect SDP value and integral optimum tending to 0.