3 papers
cs.DS2020
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…
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.DS2018
Near-Linear Time Algorithm for n-fold ILPs via Color Coding
Klaus Jansen, Alexandra Lassota, Lars Rohwedder
We study an important case of ILPs with variables and lower and upper bounds $\ell,…