Slack-pack algorithm for Meir-Moser packing problem

DOI10.1134/S1995080225615279MaRDI QIDQ7325964zbMATH OpenFDO

Authors A. D. Kislovskiy, Eh. Yu. Lerner, I. A. Senkevich

Publication date 8 September 2026

Published in Lobachevskii Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/S1995080225615279

Mathematics Subject Classification ID

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

Cites work

• A note on perfect packing of squares and cubes
• A note on three Moser's problems and two Paulhus' lemmas
• A simple method for perfect packing of squares of sidelengths \(n^{-1/2-\epsilon}\)
• An algorithm for packing squares
• scientific article; zbMATH DE number 3440485 (Why is no real title available?)
• On packing of rectangles in a rectangle
• On packing of squares and cubes
• PERFECT PACKING OF SQUARES
• Perfect packings of squares using the stack-pack strategy
• Perfect square packings
• Perfectly packing a square by squares of nearly harmonic sidelength
• The dissection of rectangles into squares.

This page was built for publication: Slack-pack algorithm for Meir-Moser packing problem

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