Bin Packing with Fixed Number of Bins Revisited

DOI10.1007/978-3-642-13731-0_25zbMath1285.68065OpenAlexW1590950521MaRDI QIDQ3569896

Stefan Kratsch, Dániel Marx, Ildikó Schlotter, Klaus Jansen

Publication date: 22 June 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13731-0_25

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (4)

A simple \(OPT+1\) algorithm for cutting stock under the modified integer round-up property assumption ⋮ Hardness and algorithms of equitable tree-coloring problem in chordal graphs ⋮ Complexity of tree-coloring interval graphs equitably ⋮ Extending partial representations of subclasses of chordal graphs

This page was built for publication: Bin Packing with Fixed Number of Bins Revisited