Optimal Sherali-Adams Gaps from Pairwise Independence

Author:

Georgiou Konstantinos,Magen Avner,Tulsiani Madhur

Publisher

Springer Berlin Heidelberg

Reference27 articles.

1. Alekhnovich, M., Arora, S., Tourlakis, I.: Towards strong nonapproximability results in the Lovász-Schrijver hierarchy. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005, ACM Press, New York (2005)

2. Arora, S., Bollobás, B., Lovász, L., Tourlakis, I.: Proving integrality gaps without knowing the linear program. Theory of Computing 2(2), 19–51 (2006)

3. Austrin, P., Mossel, E.: Approximation resistant predicates from pairwise independence. In: IEEE Conference on Computational Complexity, pp. 249–258. IEEE Computer Society Press, Los Alamitos (2008)

4. Bateni, M.H., Charikar, M., Guruswami, V.: MaxMin allocation via degree lower-bounded arborescences. In: STOC 2009. ACM Press, New York (2009)

5. Buresh-Oppenheim, J., Galesi, N., Hoory, S., Magen, A., Pitassi, T.: Rank bounds and integrality gaps for cutting planes procedures. Theory of Computing 2(4), 65–90 (2006)

Cited by 13 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Correlation Clustering with Sherali-Adams;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10

2. Superlinear Integrality Gaps for the Minimum Majority Problem;SIAM Journal on Discrete Mathematics;2021-01

3. (Semi)Algebraic proofs over {±1} variables;Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing;2020-06-06

4. No Small Linear Program Approximates Vertex Cover Within a Factor 2 − ɛ;Mathematics of Operations Research;2018-09-19

5. LP/SDP Hierarchy Lower Bounds for Decoding Random LDPC Codes;IEEE Transactions on Information Theory;2018-06

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3