5 papers
The Submodular Santa Claus Problem in the Restricted Assignment Case
Etienne Bamas, Paritosh Garg, Lars Rohwedder
The submodular Santa Claus problem was introduced in a seminal work by Goemans, Harvey, Iwata, and Mirrokni (SODA'09) as an application of their structural result. In the mentioned…
The Primal-Dual method for Learning Augmented Algorithms
Étienne Bamas, Andreas Maggiori, Ola Svensson
The extension of classical online algorithms when provided with predictions is a new and active research area. In this paper, we extend the primal-dual method for online algorithms…
Learning Augmented Energy Minimization via Speed Scaling
Étienne Bamas, Andreas Maggiori, Lars Rohwedder +1
As power management has become a primary concern in modern data centers, computing resources are being scaled dynamically to minimize energy consumption. We initiate the study of a…
The Combinatorial Santa Claus Problem or: How to Find Good Matchings in Non-Uniform Hypergraphs
Etienne Bamas, Paritosh Garg, Lars Rohwedder
We consider hypergraphs on vertices where each hyperedge contains exactly one vertex in . Our goal is to select a matching that covers all of , but we allow each se…
Distributed coloring of graphs with an optimal number of colors
Étienne Bamas, Louis Esperet
This paper studies sufficient conditions to obtain efficient distributed algorithms coloring graphs optimally (i.e.\ with the minimum number of colors) in the LOCAL model of comput…