Covering a square of side n+ with unit squares

DOI10.1016/J.JCTA.2005.08.005zbMATH Open1086.52005OpenAlexW1983641737WikidataQ106008870 ScholiaQ106008870MaRDI QIDQ817606FDOQ817606

Alexander Soifer

Publication date: 16 March 2006

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2005.08.005

zbMATH Keywords

discrete geometrypackingcombinatorialoptimal covering

Mathematics Subject Classification ID

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

Cites Work

• On packing squares with equal squares
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (6)

• Efficient packings of unit squares in a large square
• Covering the unit square by squares
• Orientational variable-length strip covering problem: a branch-and-price-based algorithm
• A Caching Game with Infinitely Divisible Hidden Material
• Packing equal squares into a large square
• Translative covering by unit squares

   Recommendations

• New results on covering triangles with triangles and squares with squares 👍 👎
• Two new problems on covering triangles with triangles and squares with squares 👍 👎
• A Note on Covering a Square of Side Length 2 + <I>ε</I> with Unit Squares 👍 👎
• Title not available (Why is that?) 👍 👎
• Covering squares with unit squares 👍 👎

This page was built for publication: Covering a square of side \(n+\varepsilon\) with unit squares

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