Author:
Bienstock Daniel,Faenza Yuri,Malinović Igor,Mastrolilli Monaldo,Svensson Ola,Zuckerberg Mark
Funder
Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung
Office of Naval Research
Subject
Applied Mathematics,Computational Theory and Mathematics,Theoretical Computer Science
Reference17 articles.
1. R.D. Carr, L.K. Fleischer, V.J. Leung, C.A. Phillips, Strengthening integrality gaps for capacitated network design and covering problems, in: Proceedings of SODA ’00, 2000, pp. 106–115.
2. N. Bansal, K. Pruhs, The geometry of scheduling, in: 51th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2010, October 23–26, 2010, Las Vegas, Nevada, USA, 2010, pp. 407–414.
3. H. An, M. Singh, O. Svensson, LP-based algorithms for capacitated facility location, in: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18–21, 2014, 2014, pp. 256–265.
4. Fast approximation algorithms for the knapsack and sum of subset problems;Ibarra;J. ACM,1975
5. Fast approximation algorithms for knapsack problems;Lawler;Math. Oper. Res.,1979
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献