Guillotine cutting is asymptotically optimal for packing consecutive squares

DOI10.1007/s11590-022-01858-wOpenAlexW4220905540WikidataQ114222152 ScholiaQ114222152MaRDI QIDQ2091225

János Balogh, Tomas Olaj, Zsolt Tuza, György Dósa, Lars Magnus Hvattum

Publication date: 1 November 2022

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-022-01858-w

zbMATH Keywords

asymptotic analysisrecursive algorithmguillotine cutsquare packingGardner's problemsquare the square

Mathematics Subject Classification ID

Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Combinatorial aspects of packing and covering (05B40)

Uses Software

• OEIS

Cites Work

• On packing squares into a rectangle
• Perfect packing of \(d\)-cubes
• Perfect packing of cubes
• Perfect square packings
• A note on perfect packing of \(d\)-dimensional cubes
• Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
• Some packing and covering theorems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Guillotine cutting is asymptotically optimal for packing consecutive squares