22 citations · 40 across the 28 of their papers we have counts for
4 papers · 1 filter
On the Configuration-LP of the Restricted Assignment Problem
Klaus Jansen, Lars Rohwedder
We consider the classical problem of Scheduling on Unrelated Machines. In this problem a set of jobs is to be distributed among a set of machines and the maximum load (makespan) is…
Improved approximation for two dimensional strip packing with polynomial bounded width
Klaus Jansen, Malin Rau
We study the well-known two-dimensional strip packing problem. Given is a set of rectangular axis-parallel items and a strip of width with infinite height. The objective is to…
Closing the Gap for Makespan Scheduling via Sparsification Techniques
Klaus Jansen, Kim-Manuel Klein, José Verschae
Makespan scheduling on identical machines is one of the most basic and fundamental packing problems studied in the discrete optimization literature. It asks for an assignment of $n…
About the Structure of the Integer Cone and its Application to Bin Packing
Klaus Jansen, Kim-Manuel Klein
We consider the bin packing problem with different item sizes and revisit the structure theorem given by Goemans and Rothvoß[6] about solutions of the integer cone. We present…