3 papers
cs.DS2026
Distributed Santa Claus via Global Rounding
Tijn de Vos, Leo Wennmann, Malte Baumecker +2
In this paper, we consider the Santa Claus problem in the CONGEST model. This NP-hard problem can be modeled as a bipartite graph of children and gifts where an edge indicates that…
cs.DS2023
The Laplacian Paradigm in Deterministic Congested Clique
Sebatian Forster, Tijn de Vos
In this paper, we bring the techniques of the Laplacian paradigm to the congested clique, while further restricting ourselves to deterministic algorithms. In particular, we show ho…
cs.DS2023
Minimum Cost Flow in the CONGEST Model
Tijn de Vos
We consider the CONGEST model on a network with nodes, edges, diameter , and integer costs and capacities bounded by . In this paper, we show how to find…