4 citations · 11 across the 8 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.DM2017
Closing the gap for pseudo-polynomial strip packing
Klaus Jansen, Malin Rau
The set of 2-dimensional packing problems builds an important class of optimization problems and Strip Packing together with 2-dimensional Bin Packing and 2-dimensional Knapsack is…
cs.CC2017★ 1 cited
Complexity and Inapproximability Results for Parallel Task Scheduling and Strip Packing
Sören Henning, Klaus Jansen, Malin Rau +1
We study the Parallel Task Scheduling problem with a constant number of machines. This problem is known to be strongly NP-complete for each , while i…