1 citations · 2 across the 7 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
cs.DS2019
Approximation Algorithms for Scheduling with Class Constraints
Klaus Jansen, Alexandra Lassota, Marten Maack
Assigning jobs onto identical machines with the objective to minimize the maximal load is one of the most basic problems in combinatorial optimization. Motivated by product planing…
cs.CC2019★ 1 cited
Inapproximability Results for Scheduling with Interval and Resource Restrictions
Marten Maack, Klaus Jansen
In the restricted assignment problem, the input consists of a set of machines and a set of jobs each with a processing time and a subset of eligible machines. The goal is to find a…
cs.DS2019
Online Bin Covering with Limited Migration
Sebastian Berndt, Leah Epstein, Klaus Jansen +3
Semi-online models where decisions may be revoked in a limited way have been studied extensively in the last years. This is motivated by the fact that the pure online model is ofte…