Author:
Alekhnovich Mikhail,Arora Sanjeev,Tourlakis Iannis
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science
Reference26 articles.
1. Sanjeev Arora, Béla Bollobás & László Lovász (2002). Proving Integrality Gaps without Knowing the Linear Program. In Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS-02), 313–322. Los Alamitos.
2. Sanjeev Arora, Béla Bollobás, László Lovász & Iannis Tourlakis (2006). Proving Integrality Gaps without Knowing the Linear Program. Theory of Computing 2(2), 19–51. URL http://www.theoryofcomputing.org/articles/main/v002/a002 .
3. Sanjeev Arora, Satish Rao & Umesh V. Vazirani (2009). Expander flows, geometric embeddings and graph partitioning. J. ACM 56(2). Preliminary version in ACM STOC 2004.
4. Joshua Buresh-Oppenheim, Nicola Galesi, Shlomo Hoory, Avner Magen & Toniann Pitassi (2006). Rank Bounds and Integrality Gaps for Cutting Planes Procedures. Theory of Computing 2(4), 65–90. URL http://www.theoryofcomputing.org/articles/main/v002/a004 .
5. Moses Charikar, Konstantin Makarychev & Yury Makarychev (2009). Integrality gaps for Sherali-Adams relaxations. In Proc. ACM STOC, 283–292.
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献