Articles under category:
Unique Games
Unique Games
|
Vol 13, Article 19 (pp 1-51)
[APRX-RND15 Spec Issue]
Improved NP-Inapproximability for $2$-Variable Linear Equations by Johan Håstad, Sangxia Huang, Rajsekar Manokaran, Ryan O'Donnell, and John Wright |
|
Vol 9, Article 24 (pp 759-781)
[APRX-RND12 Spec Issue]
Hardness of Vertex Deletion and Project Scheduling by Ola Svensson |
|
Vol 8, Article 27 (pp 623-645)
Near-Optimal and Explicit Bell Inequality Violations by Harry Buhrman, Oded Regev, Giannicola Scarpa, and Ronald de Wolf |
|
Vol 8, Article 11 (pp 239-267)
Tight Bounds on the Approximability of Almost-Satisfiable Horn SAT and Exact Hitting Set by Venkatesan Guruswami and Yuan Zhou |
|
Vol 7, Article 3 (pp 27-43)
Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs by Per Austrin, Subhash Khot, and Muli Safra |
|
Vol 5, Article 4 (pp 83-117)
SDP Gaps and UGC-hardness for Max-Cut-Gain by Subhash Khot and Ryan O'Donnell |
|
Vol 4, Article 5 (pp 111-128)
Approximation Algorithms for Unique Games by Luca Trevisan |