Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Graph Partitioning and Quadratic Integer Programming with PSD Objectives
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
Venkatesan Guruswami
Bypassing UGC from Some Optimal Geometric Inapproximability Results