Moritz Venzin

collaborators

Showing cs.DSShow all

2 papers · 1 filter

cs.DS2021

Approximate $CVP$ in time $2^{0.802 n}$ -- now in any norm!

Thomas Rothvoss, Moritz Venzin

We show that a constant factor approximation of the shortest and closest lattice vector problem in any norm can be computed in time $2^{0.802 n}$ . This contrasts the correspondin…

cs.DS2020

Efficient sequential and parallel algorithms for multistage stochastic integer programming using proximity

Jana Cslovjecsek, Friedrich Eisenbrand, Michał Pilipczuk +2

We consider the problem of solving integer programs of the form $min {c^{⊺} x : A x = b, x \geq 0}$ , where $A$ is a multistage stochastic matrix in the following sens…

Approximate CVP in time 20.802n -- now in any norm!

Efficient sequential and parallel algorithms for multistage stochastic integer programming using proximity

Approximate $CVP$ in time $2^{0.802 n}$ -- now in any norm!