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

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!