Bin packing with fixed number of bins revisited

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 prog...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Journal of computer and system sciences Ročník 79; číslo 1; s. 39 - 49
Hlavní autori: Jansen, Klaus, Kratsch, Stefan, Marx, Dániel, Schlotter, Ildikó
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier Inc 01.02.2013
Predmet:
Additive approximation
Additives
Algorithms
Bin Packing
Bins
Errors
Mathematical analysis
Mathematical models
Parameterized complexity
Running
W-hardness
Bin Packing
W-hardness
Additive approximation
Parameterized complexity
ISSN:0022-0000, 1090-2724
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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. ► We present an approximation algorithm for bin packing with additive error 1. ► The running time of our algorithm is linear in the number of items and single-exponential in the number of bins. ► We prove that (even the unary version of) bin packing is W[1]-hard parameterized by the number of bins. ► Conclusion: the number of bins has to appear in the exponent of the input size in any exact algorithm (unless W[1]=FPT).
Bibliografia:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0022-0000
1090-2724
DOI:10.1016/j.jcss.2012.04.004