Add to ORKGABSTRACT: We prove that Best Fit bin packing has linear waste on the discrete distribution U{j, k} (where items are drawn uniformly from the set {1/k, 2/k,...,j/k}) for sufficiently large kwhen j � �k and 0.66 � � � 2/3. Our results extend to continuous skewed distributions, where items are drawn uniformly on [0, a], for 0.66 � a � 2/3. This implies that the expected asymptoticperformanceratioofBestFitisstrictlygreaterthan1forthesedistributions.©2002Wile
... introduced the sum-ofsquares algorithm (SS) for online bin packing of integralsized items into i...
In the dual bin packing problem, the objective is to assign items of given size to the largest possi...
In early seventies it was shown that the asymptotic approximation ratio of BestFit bin packing is eq...
(eng) We study of the average case performance of the Best Fit algorithm for on-line bin packing und...
Abstract. We consider the one-dimensional bin packing problem with unit-capacity bins and item sizes...
In the bin packing problem, a list L of n items is to be packed into a sequence of unit capacity bin...
We prove that the First Fit bin packing algorithm is stable under the input distribution Ufk \Gamma...
Abstract. We consider the average case behavior of one-dmensional bin paekmg algorithms in the case ...
We analyze the one-dimensional bin-packing problem under the assumption that bins have unit capacity...
Many complex proesses can be modeled by (countably) infinite, multidimensional Markov chains. Unfort...
We give a simple proof and a generalization of the classical result which says that the (asymptotic)...
We prove that the First Fit bin packing algorithm is stable under the input distribution Ufk 2; kg ...
We prove that the First Fit bin packing algorithm is stable under the input distribution U{k − 2, k}...
Best-fit is the best known algorithm for on-line bin-packing, in the sense that no algorithm is know...
In this paper we consider the familiar bin-packing problem and its associated set-partitioning formu...
... introduced the sum-ofsquares algorithm (SS) for online bin packing of integralsized items into i...
In the dual bin packing problem, the objective is to assign items of given size to the largest possi...
In early seventies it was shown that the asymptotic approximation ratio of BestFit bin packing is eq...
(eng) We study of the average case performance of the Best Fit algorithm for on-line bin packing und...
Abstract. We consider the one-dimensional bin packing problem with unit-capacity bins and item sizes...
In the bin packing problem, a list L of n items is to be packed into a sequence of unit capacity bin...
We prove that the First Fit bin packing algorithm is stable under the input distribution Ufk \Gamma...
Abstract. We consider the average case behavior of one-dmensional bin paekmg algorithms in the case ...
We analyze the one-dimensional bin-packing problem under the assumption that bins have unit capacity...
Many complex proesses can be modeled by (countably) infinite, multidimensional Markov chains. Unfort...
We give a simple proof and a generalization of the classical result which says that the (asymptotic)...
We prove that the First Fit bin packing algorithm is stable under the input distribution Ufk 2; kg ...
We prove that the First Fit bin packing algorithm is stable under the input distribution U{k − 2, k}...
Best-fit is the best known algorithm for on-line bin-packing, in the sense that no algorithm is know...
In this paper we consider the familiar bin-packing problem and its associated set-partitioning formu...
... introduced the sum-ofsquares algorithm (SS) for online bin packing of integralsized items into i...
In the dual bin packing problem, the objective is to assign items of given size to the largest possi...
In early seventies it was shown that the asymptotic approximation ratio of BestFit bin packing is eq...