期刊
MATHEMATICS OF OPERATIONS RESEARCH
卷 40, 期 3, 页码 756-772出版社
INFORMS
DOI: 10.1287/moor.2014.0694
关键词
combinatorial optimization; linear programming; semidefinite programming; approximation algorithms
资金
- ARC Convention [AUWB-2012-12/17-ULB2]
- NSF [CMMI-1300144]
- NSF CAREER award
- NSF AF Medium [1408673]
We develop a framework for proving approximation limits of polynomial size linear programs (LPs) from lower bounds on the nonnegative ranks of suitably defined matrices. This framework yields unconditional impossibility results that are applicable to any LP as opposed to only programs generated by hierarchies. Using our framework, we prove that O(n(1/2-is an element of))-approximations for CLIQUE require LPs of size 2(n Omega(is an element of)). This lower bound applies to LPs using a certain encoding of CLIQUE as a linear optimization problem. Moreover, we establish a similar result for approximations of semidefinite programs by LPs. Our main technical ingredient is a quantitative improvement of Razborov's [38] rectangle corruption lemma for the high error regime, which gives strong lower bounds on the nonnegative rank of shifts of the unique disjointness matrix.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据