Bin packing with fixed number of bins revisited

Jansen, K and Kratsch, S and Marx, Dániel and Schlotter, I (2013) Bin packing with fixed number of bins revisited. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 79 (1). pp. 39-49. ISSN 0022-0000 MTMT:2156220; doi:10.1016/j.jcss.2012.04.004

[img] Text
Jansen_39_2156220_z.pdf
Restricted to Registered users only

Download (256kB) | Request a copy

Abstract

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 nO(k) 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)·nO(1) for any function f(k) (under standard complexity assumptions). On the other hand, we provide an algorithm for Bin Packing that obtains in time 2O(klog2k)+O(n) a solution with additive error at most 1, i.e., either finds a packing into k+1 bins or decides that k bins do not suffice. © 2012 Elsevier Inc.

Item Type: ISI Article
Uncontrolled Keywords: Bins, Polynomial approximation, hardness, Running time, Polynomial-time, NP-hard, Fixed numbers, Complexity assumptions, Additive errors, W[1]-hardness, Parameterized complexity, Bin packing, Additive approximation
Subjects: Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
SWORD Depositor: MTMT Injector
Depositing User: EPrints Admin
Date Deposited: 05 Feb 2014 12:32
Last Modified: 05 Feb 2014 12:32
URI: http://eprints.sztaki.hu/id/eprint/7526

Update Item Update Item