Covering a square of side \(n+\varepsilon\) with unit squares

DOI10.1016/J.JCTA.2005.08.005zbMath1086.52005OpenAlexW1983641737WikidataQ106008870 ScholiaQ106008870MaRDI QIDQ817606

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

packingdiscrete geometrycombinatorialoptimal covering

Mathematics Subject Classification ID

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

Related Items (5)

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

Cites Work

• On packing squares with equal squares
• Unnamed Item
• Unnamed Item

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