Funder
European Research Council
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference27 articles.
1. Alon, N., Spencer, J.H.: The Probabilistic Method. John Wiley & Sons, Hoboken (2005)
2. Beier, R., Vöcking, B.: Probabilistic analysis of knapsack core algorithms. In: Munro, J.I. (ed.) Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11–14, 2004, pp. 468–477. SIAM (2004)
3. Lecture Notes in Computer Science;S Borst,2021
4. Dadush, D., Huiberts, S.: A friendly smoothed analysis of the simplex method. SIAM J. Comput. 49(5), STOC18–449 (2020). https://doi.org/10.1137/18M1197205
5. Dey, S.S., Dubey, Y., Molinaro, M.: Branch-and-bound solves random binary IPs in polytime. In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 579–591. Society for Industrial and Applied Mathematics (2021). https://doi.org/10.1137/1.9781611976465.35
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献