AbstractThe FIRST FIT DECREASING algorithm for bin packing has long been famous for its guarantee that no packing it generates will use more than 119 = 1.222… times the optimal number of bins. We present a simple modified version that has essentially the same running time, should perform at least as well on average, and yet provides a guarantee of 7160 = 1.18333…
The lower bound on First-Fit's accommodating ratio, for the Unit Price Bin Packing problem, is ...
The bin-packing problem is a combinatorial optimization problem that has been widely applied in many...
Abstract. We analyze the approximation behavior of some of the best-known polynomial-time approximat...
AbstractThe FIRST FIT DECREASING algorithm for bin packing has long been famous for its guarantee th...
In the bin packing problem we are given an instance consisting of a sequence of items with sizes bet...
AbstractIn this paper, we present improved bounds for the First Fit algorithm for the bin-packing pr...
We give a simple proof and a generalization of the classical result which says that the (asymptotic)...
This paper unifies and generalizes the existing lower bounds for the one-dimensional bin packing pr...
AbstractWe revisit three famous bin packing algorithms, namely Next Fit (NF), Worst Fit (WF) and Fir...
Abstract. In the bin packing problem we are given an instance consist-ing of a sequence of items wit...
AbstractThis paper unifies and generalizes the existing lower bounds for the one-dimensional bin pac...
In early seventies it was shown that the asymptotic approximation ratio of BestFit bin packing is eq...
AbstractIt is well known that the two simple algorithms for the classic bin packing problem, NF and ...
AbstractOn-line algorithms have been extensively studied for the one-dimensional bin packing problem...
In the bin packing problem, a list L of n items is to be packed into a sequence of unit capacity bin...
The lower bound on First-Fit's accommodating ratio, for the Unit Price Bin Packing problem, is ...
The bin-packing problem is a combinatorial optimization problem that has been widely applied in many...
Abstract. We analyze the approximation behavior of some of the best-known polynomial-time approximat...
AbstractThe FIRST FIT DECREASING algorithm for bin packing has long been famous for its guarantee th...
In the bin packing problem we are given an instance consisting of a sequence of items with sizes bet...
AbstractIn this paper, we present improved bounds for the First Fit algorithm for the bin-packing pr...
We give a simple proof and a generalization of the classical result which says that the (asymptotic)...
This paper unifies and generalizes the existing lower bounds for the one-dimensional bin packing pr...
AbstractWe revisit three famous bin packing algorithms, namely Next Fit (NF), Worst Fit (WF) and Fir...
Abstract. In the bin packing problem we are given an instance consist-ing of a sequence of items wit...
AbstractThis paper unifies and generalizes the existing lower bounds for the one-dimensional bin pac...
In early seventies it was shown that the asymptotic approximation ratio of BestFit bin packing is eq...
AbstractIt is well known that the two simple algorithms for the classic bin packing problem, NF and ...
AbstractOn-line algorithms have been extensively studied for the one-dimensional bin packing problem...
In the bin packing problem, a list L of n items is to be packed into a sequence of unit capacity bin...
The lower bound on First-Fit's accommodating ratio, for the Unit Price Bin Packing problem, is ...
The bin-packing problem is a combinatorial optimization problem that has been widely applied in many...
Abstract. We analyze the approximation behavior of some of the best-known polynomial-time approximat...
DOI
Add to ORKG