3 papers
cs.DS2025
Non-Adaptive Evaluation of -of- Functions: Tight Gap and a Unit-Cost PTAS
Mads Anker Nielsen, Lars Rohwedder, Kevin Schewior
We consider the Stochastic Boolean Function Evaluation (SBFE) problem in the well-studied case of -of- functions: There are independent Boolean random variables $x_1,\dots,x_…
cs.DS2025
A -approximation algorithm for the general scheduling problem in quasipolynomial time
Alexander Armbruster, Lars Rohwedder, Andreas Wiese
We study the general scheduling problem (GSP) which generalizes and unifies several well-studied preemptive single-machine scheduling problems, such as weighted flow time, weighted…
cs.DS2025
Multiplicative assignment with upgrades
Alexander Armbruster, Lars Rohwedder, Stefan Weltge +2
We study a problem related to submodular function optimization and the exact matching problem for which we show a rather peculiar status: its natural LP-relaxation can have fractio…