Lars Rohwedder

activity

20162026

most citedLearning Augmented Energy Minimization via Speed Scaling

14 citations · 21 across the 20 of their papers we have counts for

collaborators

32 papers

math.OC2026

Polyhedral extended formulations that approximate the Gomory closure for packing problems

Friedrich Eisenbrand, Samuel Fiorini, Lars Rohwedder +1

We consider $0/1$ packing problems $max {c^{T} x : A x \leq 1, x \in {0, 1}^{n}}$ , with $A \in R_{\geq 0}^{m \times n}$ . A way to solve such problems is via tighteni…

cs.DS2025

ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines

Lars Rohwedder

Given $n$ jobs with processing times $p_{1}, \dots, p_{n} \in N$ and $m \leq n$ machines with speeds $s_{1}, \dots, s_{m} \in N$ our goal is to allocate the jobs to machines minimi…

cs.DS2024

Smoothed Analysis of the k-Swap Neighborhood for Makespan Scheduling

Lars Rohwedder, Ashkan Safari, Tjark Vredeveld

Local search is a widely used technique for tackling challenging optimization problems, offering simplicity and strong empirical performance across various problem domains. In this…

cs.DS2024

Space-Efficient Algorithm for Integer Programming with Few Constraints

Lars Rohwedder, Karol Węgrzycki

Integer linear programs $min {c^{T} x : A x = b, x \in Z_{\geq 0}^{n}}$ , where $A \in Z^{m \times n}$ , $b \in Z^{m}$ , and $c \in Z^{n}$ , can be solved…

cs.DS2024

Fine-Grained Equivalence for Problems Related to Integer Linear Programming

Lars Rohwedder, Karol Węgrzycki

Integer Linear Programming with $n$ binary variables and $m$ many $0/1$ -constraints can be solved in time $2^{O ~ (m^{2})} poly (n)$ and it is open whether the dependence o…

cs.DS2024

The Submodular Santa Claus Problem

Etienne Bamas, Sarah Morell, Lars Rohwedder

We consider the problem of allocating indivisible resources to players so as to maximize the minimum total value any player receives. This problem is sometimes dubbed the Santa Cla…