On packing squares with equal squares
From MaRDI portal
Publication:1224588
DOI10.1016/0097-3165(75)90099-0zbMath0324.05018OpenAlexW2045605776WikidataQ56169160 ScholiaQ56169160MaRDI QIDQ1224588
Publication date: 1975
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(75)90099-0
Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Combinatorial aspects of packing and covering (05B40)
Related Items
Packing anchored rectangles, Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity, Best packing of rods into boxes, Improved packings of \(n(n - 1)\) unit squares in a square, Approximation Algorithms for Maximizing the Number of Squares Packed into a Rectangle, Rigorous packing of unit squares into a circle, A Caching Game with Infinitely Divisible Hidden Material, PACKING A TRUCK — NOW WITH A TWIST!, Efficient packings of unit squares in a large square, Minimum cost partitions of a rectangle, Packing, covering and tiling in two-dimensional spaces, Oriented aligned rectangle packing problem, Orientational variable-length strip covering problem: a branch-and-price-based algorithm, Inefficiency in packing squares with unit squares, Packing the maximum number of \(m\times n\) tiles in a large \(p\times q\) rectangle, Producing dense packings of cubes, Parallel packing squares into a triangle, Packing equal squares into a large square, Saturated packings and reduced coverings obtained by perturbing tilings, Packing a convex domain with similar convex domains, Network flows and non-guillotine cutting patterns, Thoughts on a conjecture of Erdős, Emmental squares are tasty, Covering a square of side \(n+\varepsilon\) with unit squares
Cites Work
