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 2021Show 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.CG2021

A QPTAS for stabbing rectangles

Friedrich Eisenbrand, Martina Gallato, Ola Svensson +1

We consider the following geometric optimization problem: Given $n$ axis-aligned rectangles in the plane, the goal is to find a set of horizontal segments of minimum total length…

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

A QPTAS for stabbing rectangles

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