Person
Lars Rohwedder
This person is no longer with EPFL
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Related publications (5)
Please note that this is not a complete list of this person’s publications. It includes only semantically relevant works. For a full list, please refer to Infoscience.
Better Trees for Santa Claus
Etienne Michel François Bamas, Lars Rohwedder
We revisit the problem max-min degree arborescence, which was introduced by Bateni et al. [STOC'09] as a central special case of the general Santa Claus problem, which constitutes a notorious open question in approximation algorithms. In the former problem ...
New York2023Flow Time Scheduling and Prefix Beck-Fiala
Ola Nils Anders Svensson, Lars Rohwedder
We relate discrepancy theory with the classic scheduling problems of minimizing max flow time and total flow time on unrelated machines. Specifically, we give a general reduction that allows us to transfer discrepancy bounds in the prefix Beck-Fiala (bound ...
ASSOC COMPUTING MACHINERY2022A (2+epsilon)-Approximation Algorithm for Preemptive Weighted Flow Time on a Single Machine
Weighted flow time is a fundamental and very well-studied objective function in scheduling. In this paper, we study the setting of a single machine with preemptions. The input consists of a set of jobs, characterized by their processing times, release time ...
ASSOC COMPUTING MACHINERY2021