research
∙
10/05/2021
Approximate CVP in time 2^0.802 n – now in any norm!
We show that a constant factor approximation of the shortest and closest...
share
research
∙
07/14/2021
A QPTAS for stabbing rectangles
We consider the following geometric optimization problem: Given n axis-a...
research
∙
12/21/2020
Efficient sequential and parallel algorithms for multistage stochastic integer programming using proximity
We consider the problem of solving integer programs of the form min{ c^⊺...
research
∙
05/11/2020
Approximate CVP_p in time 2^0.802 n
We show that a constant factor approximation of the shortest and closest...
research
∙
05/11/2020
Approximate CVP_∞ in time 2^0.802 n
We show that a constant factor approximation of the shortest and closest...
research
∙
08/22/2019
