1 citations · 1 across the 9 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.DS2020
Speed-Robust Scheduling -- Sand, Bricks, and Rocks
Franziska Eberle, Ruben Hoeksma, Nicole Megow +3
The speed-robust scheduling problem is a two-stage problem where given machines, jobs must be grouped into at most bags while the processing speeds of the given machine…
cs.DS2020
On Hop-Constrained Steiner Trees in Tree-Like Metrics
Martin Böhm, Ruben Hoeksma, Nicole Megow +2
We consider the problem of computing a Steiner tree of minimum cost under a hop constraint which requires the depth of the tree to be at most . Our main result is an exact algor…