Moritz Venzin

According to our database, Moritz Venzin authored at least 13 papers between 2020 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

To Buy or Not to Buy: Online Rent-Or-Buy on Node-Weighted Graphs.

Sander Borst, Moritz Venzin

Proceedings of the 43rd International Symposium on Theoretical Aspects of Computer Science, 2026

2025

To buy or not to buy: deterministic rent-or-buy problems on node-weighted graphs.

Sander Borst, Moritz Venzin

CoRR, July, 2025

Learning-Augmented Online Covering Problems.

Afrouz Jabal Ameli, Laura Sanità, Moritz Venzin

CoRR, July, 2025

Stronger adversaries grow cheaper forests: online node-weighted Steiner problems.

Sander Borst, Marek Eliás, Moritz Venzin

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

Approximation algorithms for combinatorial optimization with predictions.

Antonios Antoniadis, Marek Eliás, Adam Polak, Moritz Venzin

Proceedings of the Thirteenth International Conference on Learning Representations, 2025

2022

Approximate CVP_<i>p</i> in time 2^{0.802<i>n</i>}.

Friedrich Eisenbrand, Moritz Venzin

J. Comput. Syst. Sci., 2022

Covering Convex Bodies and the Closest Vector Problem.

Márton Naszódi, Moritz Venzin

Discret. Comput. Geom., 2022

Approximate $\mathrm {CVP}_{}$ in Time 2^{0.802 n} - Now in Any Norm!

Thomas Rothvoss, Moritz Venzin

Proceedings of the Integer Programming and Combinatorial Optimization, 2022

2021

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

Thomas Rothvoss, Moritz Venzin

CoRR, 2021

A QPTAS for stabbing rectangles.

Friedrich Eisenbrand, Martina Gallato, Ola Svensson, Moritz Venzin

CoRR, 2021

Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity.

Jana Cslovjecsek, Friedrich Eisenbrand, Michal Pilipczuk, Moritz Venzin, Robert Weismantel

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

2020

Approximate $\mathrm{CVP}_{\infty}$ in time $2^{0.802 \, n}$.

Friedrich Eisenbrand, Moritz Venzin

CoRR, 2020

Approximate CVP_p in Time 2^{0.802 n}.

Friedrich Eisenbrand, Moritz Venzin

Proceedings of the 28th Annual European Symposium on Algorithms, 2020