The bottom-left algorithm for the strip packing problem

DOI10.1007/978-3-031-63021-7_33MaRDI QIDQ7021075zbMATH OpenFDO

Authors Stefan Hougardy, Bart Zondervan

Publication date 28 February 2025

Full work available at URL https://doi.org/10.1007/978-3-031-63021-7_33

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Cites work

• A (5/3+)-approximation for strip packing
• A tight \((3/2+\varepsilon)\)-approximation for skewed strip packing
• An improved BL lower bound
• Online square packing with gravity
• Orthogonal Packings in Two Dimensions
• Reducibility among combinatorial problems
• The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
• `` Strong NP-Completeness Results

This page was built for publication: The bottom-left algorithm for the strip packing problem

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