Kim-Manuel Klein

Learn More
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 jobs to a set of m identical machines that minimizes the makespan. The problem is strongly NP-hard, and thus we do not expect a (1 + ε)-approximation algorithm with a running time(More)
We consider the bin packing problem with d different item sizes and revisit the structure theorem given by Goemans and Rothvoß [6] about solutions of the integer cone. We present new techniques on how solutions can be modified and give a new structure theorem that relies on the set of vertices of the underlying integer polytope. As a result of our new(More)
We consider the fully dynamic bin packing problem, where items arrive and depart in an online fashion. The goal is to minimize the number of used bins at every timestep while repacking of already packed items is allowed. Ivkovi´c and Lloyd [IL98] have developed an algorithm with asymptotic competitive ratio of 5 /4 using O(log n) (amortized) shifting moves(More)
  • 1