Online Strip Packing with Polynomial Migration

Jansen, Klaus, Klein, Kim-Manuel, Kosche, Maria and Ladewig, Leon (2017) Online Strip Packing with Polynomial Migration [Paper] In: The 20th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems(APPROX 2017), August 16 - 18, 2017, Berkeley, USA.

Full text not available from this repository.


We consider the relaxed online strip packing problem, where rectangular items arrive online and have to be packed into a strip of fixed width such that the packing height is minimized. Thereby, repacking of previously packed items is allowed. The amount of repacking is measured by the migration factor, defined as the total size of repacked items divided by the size of the arriving item. First, we show that no algorithm with constant migration factor can produce solutions with asymptotic ratio better than 4/3. Against this background, we allow amortized migration, i.e. to save migration for a later time step. As a main result, we present an AFPTAS with asymptotic ratio 1 + O(epsilon) for any epsilon > 0 and amortized migration factor polynomial in 1/epsilon. To our best knowledge, this is the first algorithm for online strip packing considered in a repacking model.

Document Type: Conference or Workshop Item (Paper)
Research affiliation: Kiel University
Kiel University > Kiel Marine Science
OceanRep > The Future Ocean - Cluster of Excellence
Date Deposited: 19 Dec 2017 10:38
Last Modified: 19 Dec 2017 10:38

Actions (login required)

View Item View Item