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

Full description

Saved in:

Bibliographic Details
Published in:	Journal of computer and system sciences Vol. 79; no. 1; pp. 39 - 49
Main Authors:	Jansen, Klaus, Kratsch, Stefan, Marx, Dániel, Schlotter, Ildikó
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.02.2013
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!