Author:
Chlamtac Eden,Tulsiani Madhur
Reference60 articles.
1. Alekhnovich, M., Arora, S., Tourlakis, I.: Towards strong nonapproximability results in the Lovasz-Schrijver hierarchy. In: Gabow, H.N., Fagin, R. (eds.) Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA. pp. 294–303. ACM (2005)
2. Alon, N., Kahale, N.: Approximating the independence number via the theta-function. Math. Program. 80, 253–264 (1998)
3. Arora, S., Lee, J.R., Naor, A.: Euclidean distortion and the sparsest cut. J. Amer. Math. Soc. 21(1), 1–21 (2008)
4. Arora, S., Bollobás, B., Lovász, L.: Proving integrality gaps without knowing the linear program. In: Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science, pp. 313–322 (2002)
5. 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)
Cited by
49 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献