14 citations · 21 across the 20 of their papers we have counts for
5 papers · 1 filter
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…
Space-Efficient Algorithm for Integer Programming with Few Constraints
Lars Rohwedder, Karol Węgrzycki
Integer linear programs , where , , and , can be solved…
Fine-Grained Equivalence for Problems Related to Integer Linear Programming
Lars Rohwedder, Karol Węgrzycki
Integer Linear Programming with binary variables and many -constraints can be solved in time and it is open whether the dependence o…
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…
A k-swap Local Search for Makespan Scheduling
Lars Rohwedder, Ashkan Safari, Tjark Vredeveld
Local search is a widely used technique for tackling challenging optimization problems, offering significant advantages in terms of computational efficiency and exhibiting strong e…