3 papers
cs.DS2025
Minimum-Peak-Cost Flows Over Time
Mariia Anapolska, Emma Ahrens, Christina Büsing +5
When planning transportation whose operation requires non-consumable resources, the peak demand for allocated resources is often of higher interest than the duration of resource us…
cs.DS2025
A Faster Parametric Search for the Integral Quickest Transshipment Problem
Mariia Anapolska, Dario van den Boom, Christina Büsing +1
Algorithms for computing fractional solutions to the quickest transshipment problem have been significantly improved since Hoppe and Tardos first solved the problem in strongly pol…
cs.DS2024
Interval-Constrained Bipartite Matching over Time
Andreas Abels, Mariia Anapolska, Christina Büsing
Interval-constrained online bipartite matching problem frequently occurs in medical appointment scheduling: Unit-time jobs representing patients arrive online and are assigned to a…