Author:
Kurpisz Adam,Mastrolilli Monaldo,Mathieu Claire,Mömke Tobias,Verdugo Victor,Wiese Andreas
Funder
Swiss National Science Foundation
Conicyt
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference30 articles.
1. Alekhnovich, M., Arora, S., Tourlakis, I.: Towards strong nonapproximability results in the Lovász–Schrijver hierarchy. In: STOC, pp. 294–303 (2005)
2. Alon, N., Azar, Y., Woeginger, G.J., Yadid, T.: Approximation schemes for scheduling. In: SODA, pp. 493–500 (1997)
3. Arora, S., Bollobás, B., Lovász, L., Tourlakis, I.: Proving integrality gaps without knowing the linear program. Theory Comput. 2, 19–51 (2006)
4. Arora, S., Rao, S., Vazirani, U.: Expander flows, geometric embeddings and graph partitioning. J. ACM 56(2), 5 (2009)
5. Bansal, N.: Approximating independent sets in sparse graphs. In: SODA, pp. 1–8 (2015)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献