1 citations · 1 across the 2 of their papers we have counts for
5 papers
Solving Packing Problems with Few Small Items Using Rainbow Matchings
Max Bannach, Sebastian Berndt, Marten Maack +4
An important area of combinatorial optimization is the study of packing and covering problems, such as Bin Packing, Multiple Knapsack, and Bin Covering. Those problems have been st…
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…
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…
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…
Structural Parameters for Scheduling with Assignment Restrictions
Klaus Jansen, Marten Maack, Roberto Solis-Oba
We consider scheduling on identical and unrelated parallel machines with job assignment restrictions. These problems are NP-hard and they do not admit polynomial time approximation…