Showing cs.DSShow all
2 papers · 1 filter
cs.DS2026
Distributed Santa Claus via Global Rounding
Tijn de Vos, Leo Wennmann, Malte Baumecker +2
In this paper, we initiate the study of a new class of problems in the CONGEST model: Mixed packing and covering linear programs (LP). Previously, the design of optimization algori…
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…