22 citations · 40 across the 28 of their papers we have counts for
5 papers · 2 filters
Load Balancing: The Long Road from Theory to Practice
Sebastian Berndt, Max A. Deppert, Klaus Jansen +1
There is a long history of approximation schemes for the problem of scheduling jobs on identical machines to minimize the makespan. Such a scheme grants a -approximation sol…
Closing the gap for single resource constraint scheduling
Klaus Jansen, Malin Rau
In the problem called single resource constraint scheduling, we are given identical machines and a set of jobs, each needing one machine to be processed as well as a share of a…
Peak Demand Minimization via Sliced Strip Packing
Max A. Deppert, Klaus Jansen, Arindam Khan +2
We study Nonpreemptive Peak Demand Minimization (NPDM) problem, where we are given a set of jobs, specified by their processing times and energy requirements. The goal is to schedu…
Robust Online Algorithms for Dynamic Choosing Problems
Sebastian Berndt, Kilian Grage, Klaus Jansen +2
Semi-online algorithms that are allowed to perform a bounded amount of repacking achieve guaranteed good worst-case behaviour in a more realistic setting. Most of the previous work…
Solving Cut-Problems in Quadratic Time for Graphs With Bounded Treewidth
Hauke Brinkop, Klaus Jansen
In the problem (Unweighted) Max-Cut we are given a graph and asked for a set such that the number of edges from to is maximal. In th…