Tight approximation algorithms for two-dimensional guillotine strip packing

DOI10.4230/LIPICS.ICALP.2022.80MaRDI QIDQ6560877zbMATH OpenFDO

Authors Arindam Khan, Arnab Maiti, Amatya Sharma, Andreas Wiese

Publication date 24 June 2024

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2022.80

zbMATH Keywords

approximation algorithmscomputational geometryguillotine cutsrectangle packingtwo-dimensional packing

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cited in

(4)

• A PTAS for the horizontal rectangle stabbing problem
• Approximation algorithms for round-UFP and round-SAP
• Random-order online independent set of intervals and hyperrectangles
• On approximation schemes for stabbing rectilinear polygons

This page was built for publication: Tight approximation algorithms for two-dimensional guillotine strip packing

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