Add to ORKGWe study the online strip packing problem and derive an improved lower bound of ρ ≥ 2.589... for the competitive ratio of this problem. The construction is based on modified “Brown-Baker-Katseff sequences” (Brown et al. in Acta Inform. 18:207–225, 1982) using only two types of rectangles. In addition, we present an online algorithm with competitive ratio (3 + √5)/2 = 2.618... for packing instances of this type
We prove a lower bound $\rho \geq 9.001$ for the competitive ratio of the so-called online matching ...
We study strip packing, which is one of the most classical two-dimensional packing problems: given a...
In online set packing (osp), elements arrive online, announcing which sets they belong to, and the a...
We study the online strip packing problem and derive an improved lower bound of Ͽ ≥ 2.589... for the...
This note presents a lower bound of $3/2+\sqrt{33}/6 \approx 2.457$ on the competitive ratio for onl...
AbstractWe study an online multiple-strip packing problem, whose goal is to pack the given rectangle...
In the strip packing problem, the goal is to pack a set of rectangles into a vertical strip of unit ...
In this paper we consider the online scheduling of jobs which require processing on a number of mach...
AbstractIn this paper we consider the online scheduling of jobs which require processing on a number...
International audienceWe use game theory techniques to automatically compute improved lowerbounds on...
textabstractThe first algorithms for the on-line two-dimensional rectangle packing problem were intr...
We prove a lower bound ρ ≥ 9.001 for the i competitive ratio of the so-called online matching proble...
We use game theory techniques to automatically compute improved lower bounds on the competitive rati...
We improve the lower bound on the asymptotic competitive ratio of any online algorithm for bin packi...
We consider the relaxed online strip packing problem, where rectangular items arrive online and have...
We prove a lower bound $\rho \geq 9.001$ for the competitive ratio of the so-called online matching ...
We study strip packing, which is one of the most classical two-dimensional packing problems: given a...
In online set packing (osp), elements arrive online, announcing which sets they belong to, and the a...
We study the online strip packing problem and derive an improved lower bound of Ͽ ≥ 2.589... for the...
This note presents a lower bound of $3/2+\sqrt{33}/6 \approx 2.457$ on the competitive ratio for onl...
AbstractWe study an online multiple-strip packing problem, whose goal is to pack the given rectangle...
In the strip packing problem, the goal is to pack a set of rectangles into a vertical strip of unit ...
In this paper we consider the online scheduling of jobs which require processing on a number of mach...
AbstractIn this paper we consider the online scheduling of jobs which require processing on a number...
International audienceWe use game theory techniques to automatically compute improved lowerbounds on...
textabstractThe first algorithms for the on-line two-dimensional rectangle packing problem were intr...
We prove a lower bound ρ ≥ 9.001 for the i competitive ratio of the so-called online matching proble...
We use game theory techniques to automatically compute improved lower bounds on the competitive rati...
We improve the lower bound on the asymptotic competitive ratio of any online algorithm for bin packi...
We consider the relaxed online strip packing problem, where rectangular items arrive online and have...
We prove a lower bound $\rho \geq 9.001$ for the competitive ratio of the so-called online matching ...
We study strip packing, which is one of the most classical two-dimensional packing problems: given a...
In online set packing (osp), elements arrive online, announcing which sets they belong to, and the a...