Paper

Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Graph Partitioning and Quadratic Integer Programming with PSD Objectives

2011

Created by ACM worker at 2019-04-10 12:34:47.0.

Simplified Graph of Associations

Word Cloud

Research Paradigm

Authors

2

Venkatesan Guruswami

Ali Kemal Sinop

Venue

1

2011 IEEE 52nd Annual Symposium on Foundations of Computer Science

Referenced By

1

Bypassing UGC from Some Optimal Geometric Inapproximability Results