Personne
Moritz Andreas Venzin
Cette personne n’est plus à l’EPFL
Publications associées (4)
Geometric Considerations in Lattice Programming
We provide faster algorithms and fine-grained reductions for lattice problems in general norms. ...
EPFL2023Approximate CVPp in time 2(0.802n)
Friedrich Eisenbrand, Moritz Andreas Venzin
We show that a constant factor approximation of the shortest and closest lattice vector problem in any l(p)-norm can be computed in time 2((0.802 + epsilon)n). This matches the currently fastest constant factor approximation algorithm for the shortest vect ...
ACADEMIC PRESS INC ELSEVIER SCIENCE2022Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity
Friedrich Eisenbrand, Moritz Andreas Venzin, Jana Tabea Cslovjecsek
We consider the problem of solving integer programs of the form min {c^⊺ x : Ax = b, x ∈ ℤ_{⩾ 0}}, where A is a multistage stochastic matrix in the following sense: the primal treedepth of A is bounded by a parameter d, which means that the columns of A ca ...
Schloss Dagstuhl - Leibniz-Zentrum für Informatik2021Covering convex bodies and the Closest Vector Problem
Moritz Andreas Venzin, Márton Naszódi
We present faster algorithms for the approximate Closest Vector Problem under l_p norms ...
2019