research
∙
08/02/2023
Optimal Online Discrepancy Minimization
We prove that there exists an online algorithm that for any sequence of ...
share
research
∙
07/30/2023
Polytopes with Bounded Integral Slack Matrices Have Sub-Exponential Extension Complexity
We show that any bounded integral function f : A × B ↦{0,1, …, Δ} with r...
research
∙
03/26/2023
The Subspace Flatness Conjecture and Faster Integer Programming
In a seminal paper, Kannan and Lovász (1988) considered a quantity μ_KL(...
research
∙
10/29/2022
The Vector Balancing Constant for Zonotopes
The vector balancing constant vb(K,Q) of two symmetric convex bodies K,Q...
research
∙
07/07/2022
Approximate Carathéodory bounds via Discrepancy Theory
The approximate Carathéodory problem in general form is as follows: Give...
research
∙
04/30/2021
On the Hardness of Scheduling With Non-Uniform Communication Delays
In the scheduling with non-uniform communication delay problem, the inpu...
research
∙
04/21/2020
Scheduling with Communication Delays via LP Hierarchies and Clustering
We consider the classic problem of scheduling jobs with precedence const...
research
∙
07/19/2018
