Volgen
Sophie Huiberts
Sophie Huiberts
CNRS/LIMOS
Geverifieerd e-mailadres voor cnrs.fr - Homepage
Titel
Geciteerd door
Geciteerd door
Jaar
A friendly smoothed analysis of the simplex method
D Dadush, S Huiberts
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
642018
A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix
D Dadush, S Huiberts, B Natura, LA Végh
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020
302020
On the integrality gap of binary integer programs with gaussian data
S Borst, D Dadush, S Huiberts, S Tiwari
Mathematical Programming 197 (2), 1221-1263, 2023
162023
Smoothed Analysis of the Simplex Method
D Dadush, S Huiberts
Beyond the Worst-Case Analysis of Algorithms, 2020
72020
Upper and lower bounds on the smoothed complexity of the simplex method
S Huiberts, YT Lee, X Zhang
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 1904-1917, 2023
62023
A Simple Method for Convex Optimization in the Oracle Model
D Dadush, C Hojny, S Huiberts, S Weltge
arXiv preprint arXiv:2011.08557, 2021
42021
Asymptotic bounds on the combinatorial diameter of random polytopes
G Bonnet, D Dadush, U Grupel, S Huiberts, G Livshyts
arXiv preprint arXiv:2112.13027, 2021
32021
How Large is the Shadow? Smoothed Analysis of the Simplex Method
S Huiberts
22018
A nearly optimal randomized algorithm for explorable heap selection
S Borst, D Dadush, S Huiberts, D Kashaev
International Conference on Integer Programming and Combinatorial …, 2023
12023
Geometric Aspects of Linear Programming: Shadow Paths, Central Paths, and a Cutting Plane Method
S Huiberts
Utrecht University, 2022
2022
AG Connect: Wat maakt een algoritme zo snel?
S Huiberts
2021
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–11