On-line covering the unit cube by cubes

DOI10.1007/BF02574390zbMath0813.52018MaRDI QIDQ1338463

Marek Lassak, Janusz Januszewski

Publication date: 7 June 1995

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/131340

zbMATH Keywords

volumeunit cubeon-line coverings

Mathematics Subject Classification ID

Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Related Items (2)

On-line covering the unit cube by cubes ⋮ Covering of high-dimensional cubes and quantization

Cites Work

• Unnamed Item
• A sufficient condition for the covering of the unit cube by homothetic copies in the \(n\)-dimensional Euclidean space
• An on-line potato-sack theorem
• On-line covering a cube by a sequence of cubes
• On-line covering the unit cube by cubes
• Covering and packing properties of bounded sequences of convex sets

This page was built for publication: On-line covering the unit cube by cubes