Covering a square by small perimeter rectangles

DOI10.1007/BF02187679zbMath0601.52009MaRDI QIDQ1081125

Daniel J. Kleitman, Noga Alon

Publication date: 1986

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

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

zbMATH Keywords

partitionlinear programperimeterrectanglesdual program

Mathematics Subject Classification ID

Inequalities and extremum problems involving convexity in convex geometry (52A40) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Combinatorial aspects of tessellation and tiling problems (05B45) Communication theory (94A05)

Related Items (3)

The decomposition of a square into rectangles of minimal perimeter ⋮ Partitioning a rectangle into small perimeter rectangles ⋮ Decompositions of a rectangle into non-congruent rectangles of equal area

This page was built for publication: Covering a square by small perimeter rectangles