3 papers
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…
cs.DS2025
On the Approximability of Unsplittable Flow on a Path with Time Windows
Alexander Armbruster, Fabrizio Grandoni, Edin Husić +2
In the Time-Windows Unsplittable Flow on a Path problem (twUFP) we are given a resource whose available amount changes over a given time interval (modeled as the edge-capacities of…