Lecture Daniel Dadush - Integer and Linear Programming Beyond the Worst-Case

(15:14)

Daniel Dadush: Friendly smoothed analysis of the simplex method

(34:42)

Daniel Dadush: Integer Programming and the Kannan-Lovasz Conjecture

(1:1:13)

Daniel Dadush: Probabilistic analysis of the simpler method and polytope diameter

(1:35)

Daniel Dadush: On the complexity of branching proofs

(2:44:8)

Integrality Gaps for Random Integer Programs via Discrepancy by Daniel Dadush (CWI, Netherlands)

(1:4:2)

04 Daniel Dadush on Solving SVP in Time 2^n via Discrete Gaussian Sampling

(54:59)

On Approximating the Covering Radius and Finding Dense Lattice Subspaces

(1:25)

On Approximating the Covering Radius and Finding Dense Lattice Subspaces

(31:42)

Solving SVP and CVP in 2^n time with Discrete Gaussian Sampling

(36:30)

Revisiting Tardos’s Framework for Linear Programming: Faster Exact Solutions using Approximate ...

(24:)

STOC 2022 - A New Framework for Matrix Discrepancy: Partial Coloring Bounds via Mirror Descent

(21:13)

Majorizing Measures for the Optimizer

(33:7)

Solving SVP and CVP in 2^n time with Discrete Gaussian Sampling

(32:52)

Optimization

(1:22)

Linear Programs and Deterministic Rounding

(1:32:30)

Uri Dadush

(3:21)

CWI Lectures on Algebraic and Geometric methods in Optimization (Complete event)

(3:20:18)