New approximability results for two-dimensional bin packing

DOI10.1137/1.9781611973105.66MaRDI QIDQ5741774zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• New approximability results for two-dimensional bin packing
• Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
• New approximability and inapproximability results for 2-dimensional bin packing
• Improved approximation algorithm for two-dimensional bin packing
• Two for One: Tight Approximation of 2D Bin Packing

Cited in

(17)

• Hardness of approximation for orthogonal rectangle packing and covering problems
• The two-dimensional finite bin packing problem. II: New lower and upper bounds
• Approximation and online algorithms for multidimensional bin packing: a survey
• Two-dimensional bin packing with one-dimensional resource augmentation
• A 3-approximation algorithm for two-dimensional bin packing
• New approximability results for two-dimensional bin packing
• Two for One: Tight Approximation of 2D Bin Packing
• Polynomial-time approximation schemes for circle and other packing problems
• Inapproximability Results for Orthogonal Rectangle Packing Problems with Rotations
• New Approximability Results for 2-Dimensional Packing Problems
• Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems
• Two for one: tight approximation of 2D bin packing
• Improved approximation algorithm for two-dimensional bin packing
• Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
• New approximability and inapproximability results for 2-dimensional bin packing
• Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing
• Tight approximation algorithms for geometric bin packing with skewed items

This page was built for publication: New approximability results for two-dimensional bin packing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5741774)