Unique Games on the Hypercube

Naman Agarwal; Guy Kindler; Alexandra Kolla; Luca Trevisan

doi:10.4086/cjtcs.2015.001

Unique Games on the Hypercube

Naman Agarwal, Guy Kindler, Alexandra Kolla, Luca Trevisan

The Rachel and Selim Benin School of Engineering and Computer Science

The Hebrew University of Jerusalem

Research output: Contribution to journal › Article › peer-review

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(Z2). We conjecture that adding triangle inequalities to the SDP provides a polynomial time algorithm to solve Unique Games on the hypercube.

Original language	English
Journal	Chicago Journal of Theoretical Computer Science
Volume	2015
DOIs	https://doi.org/10.4086/cjtcs.2015.001
State	Published - 2015

Keywords

Hypercube
Integrality gap
Semi-definite programming
Unique games

Access to Document

10.4086/cjtcs.2015.001

http://cjtcs.cs.uchicago.edu/articles/2015/1/contents.html

Cite this

@article{30f1f0b1d9364cb5843099d494a5ece0,

title = "Unique Games on the Hypercube",

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(Z2). We conjecture that adding triangle inequalities to the SDP provides a polynomial time algorithm to solve Unique Games on the hypercube.",

keywords = "Hypercube, Integrality gap, Semi-definite programming, Unique games",

author = "Naman Agarwal and Guy Kindler and Alexandra Kolla and Luca Trevisan",

year = "2015",

doi = "10.4086/cjtcs.2015.001",

language = "الإنجليزيّة",

volume = "2015",

}

TY - JOUR

T1 - Unique Games on the Hypercube

AU - Agarwal, Naman

AU - Kindler, Guy

AU - Kolla, Alexandra

AU - Trevisan, Luca

PY - 2015

Y1 - 2015

N2 - 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(Z2). We conjecture that adding triangle inequalities to the SDP provides a polynomial time algorithm to solve Unique Games on the hypercube.

AB - 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(Z2). We conjecture that adding triangle inequalities to the SDP provides a polynomial time algorithm to solve Unique Games on the hypercube.

KW - Hypercube

KW - Integrality gap

KW - Semi-definite programming

KW - Unique games

U2 - 10.4086/cjtcs.2015.001

DO - 10.4086/cjtcs.2015.001

M3 - مقالة

VL - 2015

JO - Chicago Journal of Theoretical Computer Science

JF - Chicago Journal of Theoretical Computer Science

ER -

Unique Games on the Hypercube

Abstract

Keywords

Access to Document

Fingerprint

Cite this