Karmarkar–Karp bin packing algorithms explained

The Karmarkar–Karp (KK) bin packing algorithms are several related approximation algorithm for the bin packing problem.^[1] The bin packing problem is a problem of packing items of different sizes into bins of identical capacity, such that the total number of bins is as small as possible. Finding the optimal solution is computationally hard. Karmarkar and Karp devised an algorithm that runs in polynomial time and finds a solution with at most

OPT + l{O}(log ^{2(OPT))} bins, where OPT is the number of bins in the optimal solution. They also devised several other algorithms with slightly different approximation guarantees and run-time bounds.

The KK algorithms were considered a breakthrough in the study of bin packing: the previously-known algorithms found multiplicative approximation, where the number of bins was at most

r ⋅ OPT + s for some constants r> 1 , s> 0 , or at most ( 1+ \varepsilon) OPT + 1 .^[2] The KK algorithms were the first ones to attain an additive approximation.

Input

The input to a bin-packing problem is a set of items of different sizes, a₁,...a_n. The following notation is used:

• n - the number of items.
• m - the number of different item sizes. For each i in 1,...,m:
  • s_i is the i-th size;
  • n_i is the number of items of size s_i.
• B - the bin size.

Given an instance I, we denote:

• OPT(I) = the optimal solution of instance I.
• FOPT(I) = (a₁+...+a_n)/B = the theoretically-optimal number of bins, when all bins are completely filled with items or item fractions.

Obviously, FOPT(I) ≤ OPT(I).

High-level scheme

The KK algorithms essentially solve the configuration linear program:

minimize ~~ 1 ⋅ x ~~~ s.t. ~~ A x \geq n ~~~ and ~~ x \geq 0 ~~~ and ~~ x ~ isaninteger ~ .

Here, A is a matrix with m rows. Each column of A represents a feasible configuration - a multiset of item-sizes, such that the sum of all these sizes is at most B. The set of configurations is C. x is a vector of size C. Each element x_c of x represents the number of times configuration c is used.

• Example:^[3] suppose the item sizes are 3,3,3,3,3,4,4,4,4,4, and B=12. Then there are C=10 possible configurations: 3333; 333; 33, 334; 3, 34, 344; 4, 44, 444. The matrix A has two rows: [4,3,2,2,1,1,1,0,0,0] for s=3 and [0,0,0,1,0,1,2,1,2,3] for s=4. The vector n is [5,5] since there are 5 items of each size. A possible optimal solution is x=[1,0,0,0,0,0,1,0,0,1], corresponding to using three bins with configurations 3333, 344, 444.

There are two main difficulties in solving this problem. First, it is an integer linear program, which is computationally hard to solve. Second, the number of variables is C - the number of configurations, which may be enormous. The KK algorithms cope with these difficulties using several techniques, some of which were already introduced by de-la-Vega and Lueker. Here is a high-level description of the algorithm (where

I is the original instance):

• 1-a. Let

J be an instance constructed from I by removing small items.

• • 2-a. Let

K be an instance constructed from J by grouping items and rounding the size of items in each group to the highest item in the group.

• • • 3-a. Construct the configuration linear program for

K , without the integrality constraints.

• • • • 4. Compute a (fractional) solution x for the relaxed linear program.
    • 3-b. Round x to an integral solution for

K .

• • 2-b. "Un-group" the items to get a solution for

J .

• 1-b. Add the small items to get a solution for

I .

Below, we describe each of these steps in turn.

Step 1. Removing and adding small items

The motivation for removing small items is that, when all items are large, the number of items in each bin must be small, so the number of possible configurations is (relatively) small. We pick some constant

g\in( 0 , 1 ) , and remove from the original instance I all items smaller than g ⋅ B . Let J be the resulting instance. Note that in J , each bin can contain at most 1 /g items. We pack J and get a packing with some b _{J} bins.

Now, we add the small items into the existing bins in an arbitrary order, as long as there is room. When there is no more room in the existing bins, we open a new bin (as in next-fit bin packing). Let

b _{I} be the number of bins in the final packing. Then:

b _{I} \leq max (b _{J,} ( 1+2 g) ⋅ OPT(I) + 1 ) .

Proof. If no new bins are opened, then the number of bins remains b _{J} . If a new bin is opened, then all bins except maybe the last one contain a total size of at least B - g ⋅ B , so the total instance size is at least ( 1- g) ⋅ B ⋅ (b _{I-1)} . Therefore, FOPT \geq ( 1- g) ⋅ (b _{I-1)} , so the optimal solution needs at least ( 1- g) ⋅ (b _{I-1)} bins. So b _{I} \leq OPT/( 1- g) + 1 = ( 1+ g + g ^{2+\ldots)} OPT +1 \leq ( 1+2 g) OPT +1 .

In particular, by taking g=1/n, we get:

b _{I} \leq max (b _{J,} OPT +2 ⋅ OPT(I)/n + 1 )\leq max (b _{J,} OPT +3 ) ,

since OPT(I)\leq n . Therefore, it is common to assume that all items are larger than 1/n.

Step 2. Grouping and un-grouping items

The motivation for grouping items is to reduce the number of different item sizes, to reduce the number of constraints in the configuration LP. The general grouping process is:

• Order the items by descending size.
• Partition the items into groups.
• For each group, modify the size of all items in the group to the largest size in the group.

There are several different grouping methods.

Linear grouping

Let

k> 1 be an integer parameter. Put the largest k items in group 1; the next-largest k items in group 2; and so on (the last group might have fewer than k items). Let J be the original instance. Let K' be the first group (the group of the k largest items), and K the grouped instance without the first group. Then:

• In

K' all items have the same size. In K the number of different sizes is m(K) \leq n/k + 1 .OPT(K) \leq OPT(J) - since group 1 in J dominates group 2 in K (all k items in group 1 are larger than the k items in group 2); similarly, group 2 in J dominates group 3 in K , etc.OPT(K') \leq k - since it is possible to pack each item in K' into a single bin.

Therefore,

OPT(J) \leq OPT(K\cup K') \leq OPT(K) + OPT(K') \leq OPT(K) + k . Indeed, given a solution to K with b _{K} bins, we can get a solution to J with at most b _{K+k} bins.

Geometric grouping

Let

k> 1 be an integer parameter. Geometric grouping proceeds in two steps:

• Partition the instance

J into several instances J _{0,} J _{1,} \ldots such that, in each instance J _{r} , all sizes are in the interval [B/ 2 ^{r+1} , B/ 2 ^{r)} . Note that, if all items in J have size at least g ⋅ B , then the number of instances is at most log _{2(1/g)} .

• On each instance

J _{r} , perform linear rounding with parameter k ⋅ 2 ^{r} . Let K _{r,} K' _{r} be the resulting instances. Let K : = \cup _{r} K _{r} and K' : = \cup _{r} K' _{r} .Then, the number of different sizes is bounded as follows:

• For all r,

m(K' _{r)} = 1 and m(K _{r)} \leq n(J _{r)/(k ⋅} 2 ^{r)} + 1 . Since all items in J _{r} are larger than B/ 2 ^{r+1} , we have n(J _{r)\leq} 2 ^{r+1} ⋅ FOPT(J _{r)} , so m(K _{r)} \leq 2 FOPT(J _{r)/k} + 1 . Summing over all r gives m(K) \leq 2 FOPT(J)/k + log _{2(1/g)} .

The number of bins is bounded as follows:

• For all r,

OPT(K' _{r)} \leq k - since K' _{r} has k ⋅ 2 ^{r} items, and all of them are smaller than B/ 2 ^{r} , so they can be packed into at most k bins.

• Therefore,

OPT(K') \leq k ⋅ log _{2(1/g)} .

• Therefore,

OPT(J) \leq OPT(K) + OPT(K')\leq OPT(K) + k ⋅ log _{2(1/g)} .

Alternative geometric grouping

Let

k> 1 be an integer parameter. Order the items by descending size. Partition them into groups such that the total size in each group is at least k ⋅ B . Since the size of each item is less than B, The number of items in each group is at least k +1 . The number of items in each group is weakly-increasing. If all items are larger than g ⋅ B , then the number of items in each group is at most k/g . In each group, only the larger items are rounded up. This can be done such that:m(K) \leq FOPT(J)/k + ln ( 1 /g) .OPT(J) \leq OPT(K) +2 k ⋅ ( 2 + ln ( 1 /g)) .

Step 3. Constructing the LP and rounding the solution

We consider the configuration linear program without the integrality constraints:

minimize ~~ 1 ⋅ x ~~~ s.t. ~~ A x \geq n ~~~ and ~~ x \geq 0 .

Here, we are allowed to use a fractional number of each configuration.

• Example: suppose there are 31 items of size 3 and 7 items of size 4, and the bin-size is 10. The configurations are: 4, 44, 34, 334, 3, 33, 333. The constraints are [0,0,1,2,1,2,3]*x=31 and [1,2,1,1,0,0,0]*x=7. An optimal solution to the fractional LP is [0,0,0,7,0,0,17/3] That is: there are 7 bins of configuration 334 and 17/3 bins of configuration 333. Note that only two different configurations are needed.

Denote the optimal solution of the linear program by LOPT. The following relations are obvious:

• FOPT(I) ≤ LOPT(I), since FOPT(I) is the (possibly fractional) number of bins when all bins are completely filled with items or fractions of items. Clearly, no solution can be more efficient.
• LOPT(I) ≤ OPT(I), since LOPT(I) is a solution to a minimization problem with fewer constraints.
• OPT(I) < 2*FOPT(I), since in any packing with at least 2*FOPT(I) bins, the sum of the two least-full bins is at most B, so they can be combined into a single bin.

A solution to the fractional LP can be rounded to an integral solution as follows.

Suppose we have a solution x to the fractional LP. We round x into a solution for the integral ILP as follows.

• Let x be an optimal basic feasible solution of the fractional LP. Suppose it as

\sum _{c\in} x _{c} = b _{L} bins (note that b _{L} may be a fractional number). Since the fractional LP has m constraints (one for each distinct size), x has at most m nonzero variables, that is, at most m different configurations are used. We construct from x an integral packing consisting of a principal part and a residual part.

• The principal part contains floor(x_c) bins of each configuration c for which x_c > 0.
• For the residual part (denoted by R), we construct two candidate packings:
  • A single bin of each configuration c for which x_c > 0; all in all m bins are needed.
  • A greedy packing, with fewer than 2*FOPT(R) bins (since if there are at least 2*FOPT(R) bins, the two smallest ones can be combined).
• The smallest of these packings requires min(m, 2*FOPT(R)) ≤ average(m, 2*FOPT(R)) = FOPT(R) + m/2.
• Adding to this the rounded-down bins of the principal part yields at most

b _{L+m/2} bins.

• The execution time of this conversion algorithm is O(n log n).

This also implies that

OPT(I)\leq LOPT(I) + m/ 2 .

Step 4. Solving the fractional LP

The main challenge in solving the fractional LP is that it may have a huge number of variables - a variable for each possible configuration.

The dual LP

The dual linear program of the fractional LP is:

maximize ~~ n ⋅ y ~~~ s.t. ~~ A ^{T} y \leq 1 ~~~ and ~~ y \geq 0 .

It has m variables y _{1,\ldots,y} _{m} , and C constraints - a constraint for each configuration. It has the following economic interpretation. For each size s, we should determine a nonnegative price y _{i} . Our profit is the total price of all items. We want to maximize the profit n y subject to the constraints that the total price of items in each configuration is at most 1. This LP now has only m variables, but a huge number of constraints. Even listing all the constraints is infeasible.

Fortunately, it is possible to solve the problem up to any given precision without listing all the constraints, by using a variant of the ellipsoid method. This variant gets as input, a separation oracle: a function that, given a vector y ≥ 0, returns one of the following two options:

• Assert that y is feasible, that is,

A ^{T} y \leq 1 ; or -

• Assert that y is infeasible, and return a specific constraint that is violated, that is, a vector a such that

a ⋅ y > 1 .The ellipsoid method starts with a large ellipsoid, that contains the entire feasible domain A ^{T} y \leq 1 . At each step t, it takes the center y _{t} of the current ellipsoid, and sends it to the separation oracle:

• If the oracle says that

y _{t} is feasible, then we do an "optimality cut": we cut from the ellipsoid all points y for which n ⋅ y < n ⋅ y _{t} . These points are definitely not optimal.

• If the oracle says that

y _{t} is infeasible and violates the constraint a, then we do a "feasibility cut": we cut from the ellipsoid all points y for which a ⋅ y > 1 . These points are definitely not feasible.

After making a cut, we construct a new, smaller ellipsoid. It can be shown that this process converges to an approximate solution, in time polynomial in the required accuracy.

A separation oracle for the dual LP

We are given some m non-negative numbers

y _{1,\ldots,y} _{m} . We have to decide between the following two options:

• For every feasible configuration, the sum of

y _{i} corresponding to this configuration is at most 1; this means that y is feasible.

• There exists a feasible configuration for which the sum of

y _{i} is larger than 1; this means that y is infeasible. In this case, we also have to return the configuration.

This problem can be solved by solving a knapsack problem, where the item values are

y _{1,\ldots,y} _{m} , the item weights are s _{1,\ldots,s} _{m} , and the weight capacity is B (the bin size).

• If the total value of the optimal knapsack solution is at most 1, then we say that y is feasible.
• If the total value of the optimal knapsack solution is larger than 1, then we say that y is infeasible, and the items in the optimal knapsack solution correspond to a configuration that violates a constraint (since

a ⋅ y > 1 for the vector a that corresponds to this configuration).The knapsack problem can be solved by dynamic programming in pseudo-polynomial time: O(m ⋅ V) , where m is the number of inputs and V is the number of different possible values. To get a polynomial-time algorithm, we can solve the knapsack problem approximately, using input rounding. Suppose we want a solution with tolerance \delta . We can round each of y _{1,\ldots,y} _{m} down to the nearest multiple of \delta /n. Then, the number of possible values between 0 and 1 is n/\delta , and the run-time is O(m n /\delta) . The solution is at least the optimal solution minus \delta /n.

Ellipsoid method with an approximate separation oracle

The ellipsoid method should be adapted to use an approximate separation oracle. Given the current ellipsoid center

y _{t} :

• If the approximate oracle returns a solution with value larger than 1, then

y _{t} is definitely infeasible, and the solution correspond to a configuration that violates a constraint a. We do a "feasibility cut" in y _{t} , cutting the ellipsoid all points y for which a ⋅ y > 1 .

• If the approximate oracle returns a solution with value at most 1, then

y _{t} may or may not be feasible, but y _{t} rounded down (denote it by z _{t} ) is feasible. By definition of the rounding, we know that n ⋅ z _{t} \geq n ⋅ y _{t} - n ⋅ 1 ⋅ (\delta/n) = n ⋅ y _{t} - \delta . We still do an "optimality cut" in y _{t} : we cut from the ellipsoid all points y for which n ⋅ y < n ⋅ y _{t} . Note that y _{t} might be infeasible, so its value might be larger than OPT. Therefore, we might remove some points whose objective is optimal. However, the removed points satisfy n ⋅ y < n ⋅ z _{t+\delta} \leq OPT + \delta ; no point is removed if its value exceeds the value at z _{t} by more than \delta .Using the approximate separation oracle gives a feasible solution y* to the dual LP, with n ⋅ y ^{*} \geq LOPT - \delta , after at most Q iterations, where Q = 4 m ^{2} ln (mn/g\delta) . The total run-time of the ellipsoid method with the approximate separation oracle is O(Q m n /\delta) .

Eliminating constraints

During the ellipsoid method, we use at most Q constraints of the form

a ⋅ y \leq 1 . All the other constraints can be eliminated, since they have no effect on the outcome y* of the ellipsoid method. We can eliminate even more constraints. It is known that, in any LP with m variables, there is a set of m constraints that is sufficient for determining the optimal solution (that is, the optimal value is the same even if only these m constraints are used). We can repeatedly run the ellipsoid method as above, each time trying to remove a specific set of constraints. If the resulting error is at most \delta , then we remove these constraints permanently. It can be shown that we need at most ≈ (Q/m) + m ln (Q/m) eliminations, so the accumulating error is at most ≈ \delta ⋅ [(Q/m) + m ln (Q/m)] . If we try sets of constraints deterministically, then in the worst case, one out of m trials succeeds, so we need to run the ellipsoid method at most ≈ m ⋅ [(Q/m) + m ln (Q/m)] = Q + m ^{2ln(Q/m)} times. If we choose the constraints to remove at random, then the expected number of iterations is O(m) ⋅ [ 1 + ln (Q/m)] .

Finally, we have a reduced dual LP, with only m variables and m constraints. The optimal value of the reduced LP is at least

LOPT - h , where h ≈ \delta ⋅ [(Q/m) + m ln (Q/m)] .

Solving the primal LP

By the LP duality theorem, the minimum value of the primal LP equals the maximum value of the dual LP, which we denoted by LOPT. Once we have a reduced dual LP, we take its dual, and take a reduced primal LP. This LP has only m variables - corresponding to only m out of C configurations. The maximum value of the reduced dual LP is at least

LOPT - h . It can be shown that the optimal solution of the reduced primal LP is at most LOPT + h . The solution gives a near-optimal bin packing, using at most m configurations.

The total run-time of the deterministic algorithm, when all items are larger than

g ⋅ B , is: O\left( (Q m n)/(\delta) ⋅ ( Q + m ^{2ln (Q)/(m)} ) \right) = O \left( (Q ^{2} m n + Q m ^{3} n ln (Q)/(m))/(\delta) \right) ≈ O\left(m ^{8} ln {m} ln ^{2 ( (m n)/(g h)} ) + (m ^{4} n ln {m)/() }\ln(\frac) \right),

The expected total run-time of the randomized algorithm is:

O\left(m ^{7} log {m} log ^{2 ( (m n)/(g h)} ) + (m ^{4} n log {m)/() }\log(\frac) \right).

End-to-end algorithms

Karmarkar and Karp presented three algorithms, that use the above techniques with different parameters. The run-time of all these algorithms depends on a function

T( ⋅ , ⋅ ) , which is a polynomial function describing the time it takes to solve the fractional LP with tolerance h=1, which is, for the deterministic version,T(m,n)\in O(m ^{8log{m}log} ^{2{n}} + m ^{4} n log {m} log {n} ) .

Algorithm 1

Let

\epsilon> 0 be a constant representing the desired approximation accuracy.

• 1-a. Set

g = max ( 1 /n, \epsilon/ 2 ) . Let J be an instance constructed from I by removing all items smaller than g.

• • 2-a. Set

k = n ⋅ \epsilon ^{2} . Let K be an instance constructed from J by linear grouping with parameter k, and let K' be the remaining instance (the group of k largest items). Note that m(K) \leq n/k + 1 ≈ 1 /\epsilon ^{2} .

• • • 3-a. Construct the configuration linear program for

K , without the integrality constraints.

• • • • 4. Compute a solution x for

K , with tolerance h=1. The result is a fractional bin packing with b _{L\leq} LOPT(K) +1 bins. The run-time is T(m(K),n(K)) \leq T(\epsilon ^{-2} ,n) .

• • • 3-b. Round x to an integral solution for

K . Add at most m(K)/ 2 bins for the fractional part. The total number of bins is b _{K\leq} b _{L} + m(K)/ 2 \leq LOPT(K) +1 + 1 / 2 \epsilon ^{2} .

• • 2-b. Pack the items in

K' using at most k bins; get a packing of J . The number of bins is b _{J\leq} b _{K+k} \leq LOPT(K) +1 + 1 / 2 \epsilon ^{2} + n ⋅ \epsilon ^{2} .

• 1-b. Add the items smaller than g to get a solution for

I . The number of bins is: b _{I} \leq max (b _{J,} ( 1+2 g) ⋅ OPT(I) + 1 )\leq ( 1+ \epsilon)OPT(I) + 1 / 2 \epsilon ^{2} + 3 .

All in all, the number of bins is in

( 1+ \epsilon)OPT + O(\epsilon ^{-2} ) and the run-time is in O(n log n + T(\epsilon ^{-2} ,n)) . By choosing \epsilon = OPT ^{-1/3} we get OPT + O(OPT ^{2/3} ) .

Algorithm 2

Let

g> 0 be a real parameter and k> 0 an integer parameter to be determined later.

• 1-a. Let

J be an instance constructed from I by removing all items smaller than g.

• 2. While

FOPT(J) > 1+ (k)/(k -1) ln ( 1 /g) do:

• • 2-a. Do the Alternative Geometric Grouping with parameter k. Let

K be the resulting instance, and let K' be the remaining instance. We have m(K) \leq FOPT(J)/k + ln ( 1 /g) .

• • • 3-a. Construct the configuration linear program for

K , without the integrality constraints.

• • • • 4. Compute a solution x for

K , with tolerance h=1. The result is a fractional bin packing with b _{L\leq} LOPT(K) +1 bins. The run-time is T(m(K),n(K)) \leq T(FOPT(J)/k + ln ( 1 /g) ,n) .

• • • 3-b. Round x to an integral solution for

K . Do not add bins for the fractional part. Instead, just remove the packed items from J .

• • 2-b. Pack the items in

K' in at most 2 k ⋅ ( 2 + ln ( 1 /g)) bins.

• 2. Once

FOPT(J) \leq 1+ (k)/(k -1) ln ( 1 /g) , pack the remaining items greedily into at most 2 FOPT(J) \leq 2+ (2 k)/(k -1) ln ( 1 /g) bins.

• • At each iteration of the loop in step 2, the fractional part of x has at most m(K) patterns, so

FOPT(J _{t+1} ) \leq m(K _{t} ) \leq FOPT(J _{t} )/k + ln ( 1 /g) . The FOPT drops by a factor of k in each iteration, so the number of iterations is at most (ln FOPT(I))/(ln k) +1 .

• • Therefore, the total number of bins used for

J is: b _{J} \leq OPT(I) + \left[ 1+ (ln FOPT(I))/(ln k) \right]\left[ 1 + 4 k + 2 k ln ( 1 /g)\right] + 2 + (2 k)/(k -1) ln ( 1 /g) .

• 1-b. Add the items smaller than g to get a solution for

I . The number of bins is: b _{I} \leq max (b _{J,} ( 1+2 g) ⋅ OPT(I) + 1 ) .

The run-time is in

O(n log n + T(FOPT(J)/k + ln ( 1 /g),n)) .

Now, if we choose k=2 and g=1/FOPT(I), we get:

b _{J} \leq OPT + O( log ^{2(FOPT))} ,

and hence:

b _{I} \leq max (b _{J,} OPT +2 OPT /FOPT +1 ) \leq max (b _{J,} OPT +5 ) \in OPT +log ^{2(OPT)} ,

so the total number of bins is in OPT + O( log ^{2(FOPT))} . The run-time is O(n log n) + T(FOPT/ 2 + ln (FOPT) ,n)\in O(n log {n} + T(FOPT, n)) .

The same algorithm can be used with different parameters to trade-off run-time with accuracy. For some parameter

\alpha\in( 0 , 1 ) , choose k = FOPT ^{\alpha} and g =1 /FOPT ^{1-\alpha} . Then, the packing needs at most OPT + l{O}(OPT ^{\alpha)} bins, and the run-time is in O(n log {n} + T(FOPT ^{(1-\alpha)} ,n)) .

Algorithm 3

The third algorithm is useful when the number of sizes m is small (see also high-multiplicity bin packing).

• 1-a. Set

g = (log ^{2(m)})/(FOPT(I)) . Let K be an instance constructed from I by removing all items smaller than g.

• If

m(K)\leq FOPT(K) then:

• • 3-a. Construct the configuration linear program for

K , without the integrality constraints.

• • • 4. Compute a solution x for

K , with tolerance h=1. The result is a fractional bin packing with b _{L\leq} LOPT(K) +1 bins. The run-time is T(m(K),n(K)) \leq T(\epsilon ^{-2} ,n) .

• • 3-b. Round x to an integral solution for

K . Do not add bins for the fractional part. Instead, just remove the packed items from K .

• Run step 2 of Algorithm 2 on the remaining pieces.
• 1-b. Add the items smaller than g to get a solution for

I . The number of bins is: b _{I} \leq max (b _{J,} ( 1+2 g) ⋅ OPT(I) + 1 ) .

It uses at most

OPT + l{O}(log ^{2} m) bins, and the run-time is in O(n log {n} + T(m,n)) .

Improvements

The KK techniques were improved later, to provide even better approximations.

Rothvoss^[4] uses the same scheme as Algorithm 2, but with a different rounding procedure in Step 2. He introduced a "gluing" step, in which small items are glued together to yield a single larger item. This gluing can be used to increase the smallest item size to about

B/ log ^{12} (n) . When all sizes are at least B/ log ^{12} (n) , we can substitute g = 1 / log ^{12} (n) in the guarantee of Algorithm 2, and get:

b _{J} \leq OPT(I) + O( log (FOPT) log ( log (n))) ,

which yields a OPT + O( log ( OPT ) ⋅ loglog ( OPT )) bins.

Hoberg and Rothvoss use a similar scheme in which the items are first packed into "containers", and then the containers are packed into bins. Their algorithm needs at most

b _{J} \leq OPT(I) + O( log (OPT)) bins.

Notes and References

1. Karmarkar. Narendra. Karp. Richard M.. November 1982. An efficient approximation scheme for the one-dimensional bin-packing problem. 23rd Annual Symposium on Foundations of Computer Science (SFCS 1982). 312–320. 10.1109/SFCS.1982.61. 18583908.
2. Fernandez de la Vega. W.. Lueker. G. S.. 1981. Bin packing can be solved within 1 + ε in linear time. Combinatorica. en. 1. 4. 349–355. 10.1007/BF02579456. 1439-6912. 10519631.
3. Web site: Claire Mathieu. Approximation Algorithms Part I, Week 3: bin packing. Coursera.
4. Book: Rothvoß, T.. 2013 IEEE 54th Annual Symposium on Foundations of Computer Science . Approximating Bin Packing within O(log OPT · Log Log OPT) Bins . 2013-10-01. https://ieeexplore.ieee.org/document/6686137. 20–29. 1301.4010. 10.1109/FOCS.2013.11. 978-0-7695-5135-7. 15905063.