Unique games on expanding constraint graphs are easy
Proceedings of the fourtieth annual ACM symposium on Theory of computing - STOC 08
Madhur Tulsiani
Subhash A. Khot
Sanjeev Arora
Nisheeth K. Vishnoi
David Steurer
Bypassing UGC from Some Optimal Geometric Inapproximability Results