Bin packing with fixed number of bins revisited

  title={Bin packing with fixed number of bins revisited},
  author={Klaus Jansen and Stefan Kratsch and D{\'a}niel Marx and Ildik{\'o} Schlotter},
  journal={J. Comput. Syst. Sci.},
As Bin Packing is NP-hard already for k = 2 bins, it is unlikely to be solvable in polynomial time even if the number of bins is a fixed constant. However, if the sizes of the items are polynomially bounded integers, then the problem can be solved in time n for an input of length n by dynamic programming. We show, by proving the W[1]hardness of Unary Bin Packing (where the sizes are given in unary encoding), that this running time cannot be improved to f(k) · n for any function f(k) (under… CONTINUE READING


Publications referenced by this paper.
Showing 1-10 of 16 references

Approximation algorithms for bin packing: A survey

  • J.E.G. Coffman, M. R. Garey, D. S. Johnson
  • In D. Hochbaum, editor, Approximation Algorithms…
  • 1997

Bh sequences

  • S. W. Graham
  • In Analytic number theory, Vol. 1 (1995), volume…
  • 1996
1 Excerpt

Similar Papers

Loading similar papers…