Extending SDP integrality gaps to Sherali-Adams with applications to Quadratic Programming and MaxCutGain

12Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We show how under certain conditions one can extend constructions of integrality gaps for semidefinite relaxations into ones that hold for stronger systems: those SDP to which the so-called k-level constraints of the Sherali-Adams hierarchy are added. The value of k above depends on properties of the problem. We present two applications, to the Quadratic Programming problem and to the MaxCutGain problem. Our technique is inspired by a paper of Raghavendra and Steurer [Raghavendra and Steurer, FOCS 09] and our result gives a doubly exponential improvement for Quadratic Programming on another result by the same authors [Raghavendra and Steurer, FOCS 09]. They provide tight integrality-gap for the system above which is valid up to k = (log log n) Ω(1) whereas we give such a gap for up to k = n Ω(1). © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Benabbas, S., & Magen, A. (2010). Extending SDP integrality gaps to Sherali-Adams with applications to Quadratic Programming and MaxCutGain. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6080 LNCS, pp. 299–312). https://doi.org/10.1007/978-3-642-13036-6_23

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