Abbas Bazzi
Abbas Bazzi
Vahvistettu sähköpostiosoite verkkotunnuksessa epfl.ch
Nimike
Viittaukset
Viittaukset
Vuosi
No Small Linear Program Approximates Vertex Cover Within a Factor 2 − ɛ
A Bazzi, S Fiorini, S Pokutta, O Svensson
Mathematics of Operations Research 44 (1), 147-172, 2019
322019
Towards tight lower bounds for scheduling problems
A Bazzi, A Norouzi-Fard
Algorithms-Esa 2015, 118-129, 2015
152015
Small extended formulation for knapsack cover inequalities from monotone circuits
A Bazzi, S Fiorini, S Huang, O Svensson
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
112017
An efficient streaming algorithm for the submodular cover problem
A Norouzi-Fard, A Bazzi, I Bogunovic, M El Halabi, YP Hsieh, V Cevher
Advances in Neural Information Processing Systems 29, 4493-4501, 2016
72016
Strengths and Limitations of Linear Programming Relaxations
A Bazzi
EPFL, 2017
2017
Hardness of Approximation and Iterative Rounding Algorithms
A Bazzi
Järjestelmä ei voi suorittaa toimenpidettä nyt. Yritä myöhemmin uudelleen.
Artikkelit 1–6