Improving the 1-Bounded Space Algorithms for 2-Dimensional Online Bin Packing
Document typeMaster thesis (pre-Bologna period)
Rights accessOpen Access
In this paper we study the 1-bounded space of 2-dimensional bin pack- ing. A sequence of rectangular items arrive one at a time, and the follow- ing item arrives only after the packing of the previous one, which after being packed cannot be moved. The bin size is 1 1 and the width and height of the items are 1. The objective is to minimize the number of bins used to pack all the items. At any time there is only 1 active bin, and the previously closed bins cannot be used for any subsequent items. The new algorithm o ers an improvement of the previous best known 8:84-competitive algorithm to a 6:53-competitive, it also raises the lower bound from 2:5 to 2:^6.
Showing items related by title, author, creator and subject.
Reliability bounds for fault-tolerant systems with deferred repair using bounding split regenerative randomization Temsamani, Jamal; Carrasco, Juan A. (2013-08)
Open AccessA numerically stable method is developed which computes seemingly tight bounds at a small computational cost relative to the model size, when that model size is large, for the unreliability and bounds for the unreliability ...
Bounds of functional outputs for parabolic problems. Part I: Exact bounds of the discontinuous Galerkin time discretization Parés Mariné, Núria; Díez, Pedro; Huerta, Antonio (2008-03)
Open AccessClassical implicit residual type error estimators require using an underlying spatial finer mesh to compute bounds for some quantity of interest. Consequently, the bounds obtained are only guaranteed asymptotically that ...
Parés Mariné, Núria; Díez, Pedro; Huerta, Antonio (2008-03)
Open AccessThe paper introduces a methodology to compute upper and lower bounds for linear-functional outputs of the exact solutions of parabolic problems. In this second part, the bounds account for the error both in space and time. ...