Unique Games on the Hypercube
Computational Complexity
2014-05-07 v1 Data Structures and Algorithms
Abstract
In this paper, we investigate the validity of the Unique Games Conjecture when the constraint graph is the boolean hypercube. We construct an almost optimal integrality gap instance on the Hypercube for the Goemans-Williamson semidefinite program (SDP) for Max-2-LIN. We conjecture that adding triangle inequalities to the SDP provides a polynomial time algorithm to solve Unique Games on the hypercube.
Cite
@article{arxiv.1405.1374,
title = {Unique Games on the Hypercube},
author = {Naman Agarwal and Guy Kindler and Alexandra Kolla and Luca Trevisan},
journal= {arXiv preprint arXiv:1405.1374},
year = {2014}
}