Author:
Kurpisz Adam,Leppänen Samuli,Mastrolilli Monaldo
Publisher
Springer International Publishing
Reference32 articles.
1. Bansal, N., Buchbinder, N., Naor, J.: Randomized competitive algorithms for generalized caching. In: STOC, pp. 235–244 (2008)
2. Bansal, N., Gupta, A., Krishnaswamy, R.: A constant factor approximation algorithm for generalized min-sum set cover. In: SODA, pp. 1539–1545 (2010)
3. Bansal, N., Pruhs, K.: The geometry of scheduling. In: FOCS, pp. 407–414 (2010)
4. Barak, B., Chan, S.O., Kothari, P.: Sum of squares lower bounds from pairwise independence. In: STOC (2015)
5. Barak, B., Steurer, D.: Sum-of-squares proofs, the quest toward optimal algorithms. In: Electronic Colloquium on Computational Complexity (ECCC), vol. 21, p. 59 (2014)
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献