2 papers
cs.DS2026
Graph Scheduling with Group Completion Times
Lars Rohwedder, Leander Schnaars
In the Graph Scheduling problem we schedule a given multiset of edges on discrete time steps, such that at each step the set of edges forms a matching. The goal is to minimize the…
cs.DS2025
3.415-Approximation for Coflow Scheduling via Iterated Rounding
Lars Rohwedder, Leander Schnaars
We provide an algorithm giving a ()-approximation for Coflow Scheduling and a -approximation for Coflow Scheduling with release dates. This improves u…