Tight Approximation Algorithms For Geometric Bin Packing with Skewed Items

DOI10.4230/LIPICS.APPROX/RANDOM.2021.22MaRDI QIDQ6090896zbMATH OpenOpenAlexFDO

Authors Arindam Khan, Eklavya Sharma

Publication date 20 November 2023

Full work available at URL https://arxiv.org/pdf/2105.02827

zbMATH Keywords

approximation algorithmsgeometric bin packingguillotine separability

Mathematics Subject Classification ID

Randomized algorithms (68W20) Approximation algorithms (68W25) Combinatorial optimization (90C27)

Recommendations

• Tight approximation algorithms for geometric bin packing with skewed items
• scientific article; zbMATH DE number 3997164
• Approximation algorithms for extensible bin packing
• Approximation algorithms for extensible bin packing
• A tight lower bound for optimal bin packing
• A sublinear-time approximation scheme for bin packing
• scientific article; zbMATH DE number 3890754
• A dense hierarchy of sublinear time approximation schemes for bin packing
• scientific article; zbMATH DE number 5371761
• Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes

Cited in

(4)

• Tight approximation algorithms for geometric bin packing with skewed items
• There is no APTAS for 2-dimensional vector bin packing: revisited
• A PTAS for the horizontal rectangle stabbing problem
• Approximation algorithms for round-UFP and round-SAP

This page was built for publication: Tight Approximation Algorithms For Geometric Bin Packing with Skewed Items

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