The matching problem has no small symmetric SDP

6Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.

Abstract

Yannakakis [27, 26] showed that the matching problem does not have a small symmetric linear program. RothvoB [23] recently proved that any, not necessarily symmetric, linear program also has exponential size. It is natural to ask whether the matching problem can be expressed compactly in a framework such as semidef-inite programming (SDP) that is more powerful than linear programming but still allows efficient optimization. We answer this question negatively for symmetric SDPs: any symmetric SDP for the matching problem has exponential size. We also show that an 0(fc)-round Lasserre SDP relaxation for the asymmetric metric traveling salesperson problem yields at least as good an approximation as any symmetric SDP relaxation of size nk. The key technical ingredient underlying both these results is an upper bound on the degree needed to derive polynomial identities that hold over the space of matchings or traveling salesperson tours.

Cite

CITATION STYLE

APA

Braun, G., Brown-Cohen, J., Huq, A., Pokutta, S., Raghavendra, P., Roy, A., … Zink, D. (2016). The matching problem has no small symmetric SDP. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (Vol. 2, pp. 1067–1078). Association for Computing Machinery. https://doi.org/10.1137/1.9781611974331.ch75

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free