On packing of squares and cubes

From MaRDI portal
Revision as of 03:31, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5550367

DOI10.1016/S0021-9800(68)80047-XzbMath0165.25202WikidataQ105838292 ScholiaQ105838292MaRDI QIDQ5550367

No author found.

Publication date: 1968

Published in: Journal of Combinatorial Theory (Search for Journal in Brave)




Related Items (51)

Covering and packing properties of bounded sequences of convex setsOn packing unequal rectangles in the unit squareOptimal packing of similar trianglesPolynomial-time approximation schemes for circle and other packing problemsOnline algorithms for 1-space bounded multidimensional bin packing and hypercube packingApproximation and online algorithms for multidimensional bin packing: a surveyTwo packing problemsDynamic multi-dimensional bin packingPerfectly packing a cube by cubes of nearly harmonic sidelengthFilling space with hypercubes of two sizes – The pythagorean tiling in higher dimensionsPacking a triangle by equilateral triangles of harmonic sidelengthsPacking batches of cubes into a single binPacking squares into a rectangle with a relatively small areaCube packing.Perfectly packing a square by squares of sidelength \(f(n)^{-t}\)A simple method for perfect packing of squares of sidelengths \(n^{-1/2-\epsilon}\)Packing Rectangles into 2OPT Bins Using RotationsPacking a tetrahedron by similar tetrahedraOn packing squares into a rectangleAbsolute approximation ratios for packing rectangles into binsRectangle packing with additional restrictionsTwo-dimensional strip packing with unloading constraintsPrices of Anarchy of Selfish 2D Bin Packing GamesOnline packing of \(d\)-dimensional boxes into the unit cubeOnline removable square packingTwo-dimensional packing with conflictsPacking, covering and tiling in two-dimensional spacesProblems, problems, problemsRelations between capacity utilization, minimal bin size and bin numberPacking of odd squares revisitedA GENERALIZATION OF A THEOREM OF KLEITMAN AND KRIEGERTranslative packing of a convex body by sequences of its positive homothetic copiesOnline square-into-square packingCovering a set with homothets of a convex bodyMultidimensional cube packingAn approximation algorithm for square packing.On packing of rectangles in a rectangleA note on perfect packing of squares and cubesONE-SPACE BOUNDED ALGORITHMS FOR TWO-DIMENSIONAL BIN PACKINGTranslative covering by homothetic copiesAn algorithm for packing squaresApproximation algorithms for orthogonal packing problems for hypercubesTwo Dimensional Strip Packing with Unloading ConstraintsSelfish Square PackingPerfect packing of \(d\)-cubesTechniques and results on approximation algorithms for packing circlesPerfect square packingsOn packings of squares and rectanglesUnnamed ItemTiling the unit square with squares and rectanglesCompactness theorems for geometric packings






This page was built for publication: On packing of squares and cubes