On packing of squares and cubes
From MaRDI portal
Publication:5550367
Cited in
(53)- Bounds on soft rectangle packing ratios
- Packing of non-blocking four-dimensional cubes into the unit cube.
- Packing of non-blocking cubes into the unit cube
- A note on perfect packing of squares and cubes
- Approximation algorithms for orthogonal packing problems for hypercubes
- Packing, covering and tiling in two-dimensional spaces
- An approximation algorithm for square packing.
- Two-dimensional packing with conflicts
- Packing Rectangles into 2OPT Bins Using Rotations
- Translative packing of a convex body by sequences of its positive homothetic copies
- Packing a tetrahedron by similar tetrahedra
- Online packing of \(d\)-dimensional boxes into the unit cube
- Tiling the unit square with squares and rectangles
- A simple method for perfect packing of squares of sidelengths \(n^{-1/2-\epsilon}\)
- On packings of squares and rectangles
- Perfectly packing a cube by cubes of nearly harmonic sidelength
- Perfect packing of \(d\)-cubes
- A generalization of a theorem of Kleitman and Krieger
- Multidimensional cube packing
- Perfectly packing a square by squares of sidelength \(f(n)^{-t}\)
- Absolute approximation ratios for packing rectangles into bins
- Two packing problems
- Compactness theorems for geometric packings
- Optimal packing of similar triangles
- Selfish square packing
- Approximation and online algorithms for multidimensional bin packing: a survey
- On packing of rectangles in a rectangle
- scientific article; zbMATH DE number 7047830 (Why is no real title available?)
- Online removable square packing
- Techniques and results on approximation algorithms for packing circles
- Prices of anarchy of selfish 2D bin packing games
- On packing squares into a rectangle
- Covering a set with homothets of a convex body
- Packing of odd squares revisited
- Covering and packing properties of bounded sequences of convex sets
- Two dimensional strip packing with unloading constraints
- One-space bounded algorithms for two-dimensional bin packing
- An algorithm for packing squares
- Problems, problems, problems
- Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing
- Cube packing.
- Relations between capacity utilization, minimal bin size and bin number
- On packing unequal rectangles in the unit square
- Packing squares into a rectangle with a relatively small area
- Translative covering by homothetic copies
- Packing a triangle by equilateral triangles of harmonic sidelengths
- Polynomial-time approximation schemes for circle and other packing problems
- Dynamic multi-dimensional bin packing
- Rectangle packing with additional restrictions
- Two-dimensional strip packing with unloading constraints
- Packing batches of cubes into a single bin
- Perfect square packings
- Filling space with hypercubes of two sizes – The pythagorean tiling in higher dimensions
This page was built for publication: On packing of squares and cubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5550367)
