ECCC-Report TR16-117https://eccc.weizmann.ac.il/report/2016/117Comments and Revisions published for TR16-117en-usMon, 01 Aug 2016 19:02:44 +0300
Revision 1
| From Weak to Strong LP Gaps for all CSPs |
Mrinalkanti Ghosh,
Madhur Tulsiani
https://eccc.weizmann.ac.il/report/2016/117#revision1We study the approximability of constraint satisfaction problems (CSPs) by linear programming (LP) relaxations. We show that for every CSP, the approximation obtained by a basic LP relaxation, is no weaker than the approximation obtained using relaxations given by $\Omega\left(\frac{\log n}{\log \log n}\right)$ levels of the Sherali-Adams hierarchy on instances of size $n$.
It was proved by Chan et al. [FOCS 2013] that any polynomial size LP extended formulation is no stronger than relaxations obtained by a super-constant levels of the Sherali-Adams hierarchy. Combining this with our result also implies that the any polynomial size LP extended formulation is no stronger than the basic LP.
Using our techniques, we also simplify and strengthen the result by Khot et al. [STOC 2014] on (strong) approximation resistance for LPs. They provided a necessary and sufficient condition under which $\Omega(\log \log n)$ levels of the Sherali-Adams hierarchy cannot achieve an approximation better than a random assignment. We simplify their proof and strengthen the bound to $\Omega\left(\frac{\log n}{\log \log n}\right)$ levels.
Mon, 01 Aug 2016 19:02:44 +0300https://eccc.weizmann.ac.il/report/2016/117#revision1
Paper TR16-117
| From Weak to Strong LP Gaps for all CSPs |
Mrinalkanti Ghosh,
Madhur Tulsiani
https://eccc.weizmann.ac.il/report/2016/117We study the approximability of constraint satisfaction problems (CSPs) by linear programming (LP) relaxations. We show that for every CSP, the approximation obtained by a basic LP relaxation, is no weaker than the approximation obtained using relaxations given by $\Omega\left(\frac{\log n}{\log \log n}\right)$ levels of the Sherali-Adams hierarchy on instances of size $n$.
It was proved by Chan et al. [FOCS 2013] that any polynomial size LP extended formulation is no stronger than relaxations obtained by a super-constant levels of the Sherali-Adams hierarchy. Combining this with our result also implies that the any polynomial size LP extended formulation is no stronger than the basic LP.
Using our techniques, we also simplify and strengthen the result by Khot et al. [STOC 2014] on (strong) approximation resistance by LPs. They provided a necessary and sufficient condition under which $\Omega(\log \log n)$ levels of the Sherali-Adams hierarchy cannot achieve an approximation better than a random assignment. We simplify their proof and strengthen the bound to $\Omega\left(\frac{\log n}{\log \log n}\right)$ levels.
Sun, 31 Jul 2016 23:06:55 +0300https://eccc.weizmann.ac.il/report/2016/117