A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf
.
On the Power of Symmetric LP and SDP Relaxations
2014
2014 IEEE 29th Conference on Computational Complexity (CCC)
We study the computational power of general symmetric relaxations for combinatorial optimization problems, both in the linear programming (LP) and semidefinite programming (SDP) case. We show new connections to explicit LP and SDP relaxations, like those obtained from standard hierarchies. Concretely, for k < n/4, we show that k-rounds of sum-ofsquares / Lasserre relaxations of size k n k achieve best-possible approximation guarantees for Max CSPs among all symmetric SDP relaxations of size at
doi:10.1109/ccc.2014.10
dblp:conf/coco/LeeRST14
fatcat:rljvsqsehvfmvnnjoz6wrtidhq