
Majorizing Measures for the Optimizer
The theory of majorizing measures, extensively developed by Fernique, Ta...
read it

On the Integrality Gap of Binary Integer Programs with Gaussian Data
For a binary integer program (IP) max c^𝖳 x, Ax ≤ b, x ∈{0,1}^n, where A...
read it

Simple Iterative Methods for Linear Optimization over Convex Sets
We give simple iterative methods for computing approximately optimal pri...
read it

Revisiting Tardos's Framework for Linear Programming: Faster Exact Solutions using Approximate Solvers
In breakthrough work, Tardos (Oper. Res. '86) gave a proximity based fra...
read it

On the Complexity of Branching Proofs
We consider the task of proving integer infeasibility of a bounded conve...
read it

A scalinginvariant algorithm for linear programming whose running time depends only on the constraint matrix
Following the breakthrough work of Tardos in the bitcomplexity model, V...
read it

Latticebased Locality Sensitive Hashing is Optimal
Locality sensitive hashing (LSH) was introduced by Indyk and Motwani (ST...
read it

A Friendly Smoothed Analysis of the Simplex Method
Explaining the excellent practical performance of the simplex method for...
read it
Daniel Dadush
is this you? claim profile