Moritz Venzin

activity

20192025

most citedApproximation Algorithms for Combinatorial Optimization with Predictions

1 citations · 1 across the 8 of their papers we have counts for

collaborators

Showing 2021 · cs.DSShow all

1 paper · 2 filters

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…

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

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