52 citations · 131 across the 29 of their papers we have counts for
4 papers · 1 filter
From approximate to exact integer programming
Daniel Dadush, Friedrich Eisenbrand, Thomas Rothvoss
Approximate integer programming is the following: For a convex body , either determine whether is empty, or find an integer point in…
A nearly optimal randomized algorithm for explorable heap selection
Sander Borst, Daniel Dadush, Sophie Huiberts +1
Explorable heap selection is the problem of selecting the th smallest value in a binary heap. The key values can only be accessed by traversing through the underlying infinite b…
Interior point methods are not worse than Simplex
Xavier Allamigeon, Daniel Dadush, Georg Loho +2
We develop a new `subspace layered least squares' interior point method (IPM) for solving linear programs. Applied to an -variable linear program in standard form, the iteration…
Integrality Gaps for Random Integer Programs via Discrepancy
Sander Borst, Daniel Dadush, Dan Mikulincer
We prove new bounds on the additive gap between the value of a random integer program with constraints and that of its linear programming…