3 papers
math.CO2026
Non-Additive Discrepancy: Coverage Functions in a Beck-Fiala Setting
Tatiana Rocha Avila, Lars Rohwedder, Leo Wennmann
Recent concurrent work by Dupré la Tour and Fujii and by Hollender, Manurangsi, Meka, and Suksompong [ITCS'26] introduced a generalization of classical discrepancy theory to non-a…
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.DS2025
Cost Preserving Dependent Rounding for Allocation Problems
Lars Rohwedder, Arman Rouhani, Leo Wennmann
We present a dependent randomized rounding scheme, which rounds fractional solutions to integral solutions satisfying certain hard constraints on the output while preserving Cherno…