Bin packing with fixed number of bins revisited
From MaRDI portal
Publication:1936245
DOI10.1016/j.jcss.2012.04.004zbMath1261.68065MaRDI QIDQ1936245
Klaus Jansen, Stefan Kratsch, Dániel Marx, Ildikó Schlotter
Publication date: 21 February 2013
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2012.04.004
bin packing; parameterized complexity; W[1-hardness]; additive approximation
90C27: Combinatorial optimization
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)