Some packing and covering theorems
From MaRDI portal
Publication:5532221
DOI10.4064/cm-17-1-103-110zbMath0152.39502OpenAlexW239990970MaRDI QIDQ5532221
Publication date: 1967
Published in: Colloquium Mathematicum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4064/cm-17-1-103-110
Related Items
\(\gamma\)-soft packings of rectangles, On packing unequal rectangles in the unit square, Parallel packing of triangles with squares, Optimal packing of similar triangles, Improved Bound for Online Square-into-Square Packing, Packing into the smallest square: worst-case analysis of lower bounds, Parallel covering of isosceles triangles with squares, Two packing problems, Packing disks into disks with optimal worst-case density, Packing batches of cubes into a single bin, Packing a tetrahedron by similar tetrahedra, On packing squares into a rectangle, Rectangle packing with additional restrictions, Online packing of \(d\)-dimensional boxes into the unit cube, Packing, covering and tiling in two-dimensional spaces, Problems, problems, problems, Split packing: algorithms for packing circles with optimal worst-case density, Translative packing of a convex body by sequences of its positive homothetic copies, Online square-into-square packing, Translative covering by unit squares, On parallel packing and covering of squares and cubes, Unnamed Item, Parallel packing and covering of an equilateral triangle with sequences of squares, Packing Geometric Objects with Optimal Worst-Case Density (Multimedia Exposition), Packing batches of items into a single bin, Parallel packing squares into a triangle, Eigenvalues of the Laplacian on domains with fractal boundary, On space coverings by unbounded convex sets, Guillotine cutting is asymptotically optimal for packing consecutive squares, An on-line potato-sack theorem
