Showing cs.DSShow all
3 papers · 1 filter
cs.DS2026
Improved Approximation Algorithms for Non-Preemptive Throughput Maximization
Alexander Armbruster, Fabrizio Grandoni, Antoine Tinguely +1
The (Non-Preemptive) Throughput Maximization problem is a natural and fundamental scheduling problem. We are given jobs, where each job is characterized by a processing tim…
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…
cs.DS2022
An O(loglog n)-Approximation for Submodular Facility Location
Fateme Abbasi, Marek Adamczyk, Miguel Bosch-Calvo +4
In the Submodular Facility Location problem (SFL) we are given a collection of clients and facilities in a metric space. A feasible solution consists of an assignment of ea…