Showing cs.DSShow all
3 papers · 1 filter
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.DS2024
Public Event Scheduling with Busy Agents
Bo Li, Lijun Li, Minming Li +1
We study a public event scheduling problem, where multiple public events are scheduled to coordinate the availability of multiple agents. The availability of each agent is determin…
cs.DS2023
Scheduling with a Limited Testing Budget
Christoph Damerius, Peter Kling, Minming Li +2
Scheduling with testing falls under the umbrella of the research on optimization with explorable uncertainty. In this model, each job has an upper limit on its processing time that…