New Approximability Results for Two-Dimensional Bin Packing

DOI10.1137/1.9781611973105.66zbMath1423.90228OpenAlexW4252275530MaRDI QIDQ5741774

Lars Prädel, Klaus Jansen

Publication date: 15 May 2019

Published in: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://macau.uni-kiel.de/receive/macau_mods_00001779

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Approximation algorithms (68W25)

Related Items (4)

Polynomial-time approximation schemes for circle and other packing problems ⋮ Approximation and online algorithms for multidimensional bin packing: a survey ⋮ Tight approximation algorithms for geometric bin packing with skewed items ⋮ Online square-into-square packing

This page was built for publication: New Approximability Results for Two-Dimensional Bin Packing