On packing of squares and cubes
From MaRDI portal
Publication:5550367
DOI10.1016/S0021-9800(68)80047-XzbMATH Open0165.25202WikidataQ105838292 ScholiaQ105838292MaRDI QIDQ5550367FDOQ5550367
Authors:
Publication date: 1968
Published in: Journal of Combinatorial Theory (Search for Journal in Brave)
Cited In (54)
- Packing of non-blocking four-dimensional cubes into the unit cube.
- Packing of non-blocking cubes into the unit cube
- Packing a tetrahedron by similar tetrahedra
- Bounds on soft rectangle packing ratios
- Translative packing of a convex body by sequences of its positive homothetic copies
- An algorithm for packing squares
- A note on perfect packing of squares and cubes
- Two packing problems
- Online removable square packing
- Approximation algorithms for orthogonal packing problems for hypercubes
- On packings of squares and rectangles
- Online packing of \(d\)-dimensional boxes into the unit cube
- Optimal packing of similar triangles
- Covering and packing properties of bounded sequences of convex sets
- A GENERALIZATION OF A THEOREM OF KLEITMAN AND KRIEGER
- Approximation and online algorithms for multidimensional bin packing: a survey
- On packing unequal rectangles in the unit square
- Dynamic multi-dimensional bin packing
- Translative covering by homothetic copies
- Polynomial-time approximation schemes for circle and other packing problems
- Filling space with hypercubes of two sizes – The pythagorean tiling in higher dimensions
- An approximation algorithm for square packing.
- Two-dimensional packing with conflicts
- Perfect square packings
- Packing, covering and tiling in two-dimensional spaces
- Absolute approximation ratios for packing rectangles into bins
- Selfish square packing
- Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing
- Packing a triangle by equilateral triangles of harmonic sidelengths
- Prices of Anarchy of Selfish 2D Bin Packing Games
- Two dimensional strip packing with unloading constraints
- Title not available (Why is that?)
- Covering a set with homothets of a convex body
- Cube packing.
- Perfect packing of \(d\)-cubes
- Packing Rectangles into 2OPT Bins Using Rotations
- Relations between capacity utilization, minimal bin size and bin number
- Packing batches of cubes into a single bin
- One-space bounded algorithms for two-dimensional bin packing
- Perfectly packing a square by squares of sidelength \(f(n)^{-t}\)
- Problems, problems, problems
- Rectangle packing with additional restrictions
- Perfectly packing a cube by cubes of nearly harmonic sidelength
- Multidimensional cube packing
- On packing of rectangles in a rectangle
- Tiling the unit square with squares and rectangles
- A simple method for perfect packing of squares of sidelengths \(n^{-1/2-\epsilon}\)
- Compactness theorems for geometric packings
- Techniques and results on approximation algorithms for packing circles
- Packing squares into a rectangle with a relatively small area
- Two-dimensional strip packing with unloading constraints
- Packing of odd squares revisited
- Online square-into-square packing
- On packing squares into a rectangle
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)
