The following pages link to On packing of squares and cubes (Q5550367):
Displaying 47 items.
- Polynomial-time approximation schemes for circle and other packing problems (Q329299) (← links)
- Packing, covering and tiling in two-dimensional spaces (Q472930) (← links)
- Relations between capacity utilization, minimal bin size and bin number (Q490141) (← links)
- Online square-into-square packing (Q521815) (← links)
- Dynamic multi-dimensional bin packing (Q616986) (← links)
- On packing squares into a rectangle (Q634254) (← links)
- Rectangle packing with additional restrictions (Q650936) (← links)
- Packing of odd squares revisited (Q669610) (← links)
- An approximation algorithm for square packing. (Q703277) (← links)
- On packing of rectangles in a rectangle (Q724873) (← links)
- Perfect packing of \(d\)-cubes (Q779143) (← links)
- Online removable square packing (Q927402) (← links)
- Two-dimensional packing with conflicts (Q929297) (← links)
- Translative packing of a convex body by sequences of its positive homothetic copies (Q955193) (← links)
- Covering a set with homothets of a convex body (Q963677) (← links)
- Approximation algorithms for orthogonal packing problems for hypercubes (Q1035685) (← links)
- Tiling the unit square with squares and rectangles (Q1062992) (← links)
- Problems, problems, problems (Q1175791) (← links)
- An algorithm for packing squares (Q1268620) (← links)
- On packing unequal rectangles in the unit square (Q1337180) (← links)
- Optimal packing of similar triangles (Q1345878) (← links)
- Two packing problems (Q1377835) (← links)
- Cube packing. (Q1401310) (← links)
- Compactness theorems for geometric packings (Q1604558) (← links)
- Multidimensional cube packing (Q1762987) (← links)
- Translative covering by homothetic copies (Q1801630) (← links)
- Perfect square packings (Q1841223) (← links)
- On packings of squares and rectangles (Q1842172) (← links)
- A note on perfect packing of squares and cubes (Q2036608) (← links)
- Techniques and results on approximation algorithms for packing circles (Q2082050) (← links)
- Online packing of \(d\)-dimensional boxes into the unit cube (Q2220997) (← links)
- Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing (Q2392739) (← links)
- Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
- Absolute approximation ratios for packing rectangles into bins (Q2434269) (← links)
- Two-dimensional strip packing with unloading constraints (Q2448886) (← links)
- Packing batches of cubes into a single bin (Q2680229) (← links)
- Perfectly packing a square by squares of sidelength \(f(n)^{-t}\) (Q2685328) (← links)
- Two Dimensional Strip Packing with Unloading Constraints (Q2840691) (← links)
- Selfish Square Packing (Q2840737) (← links)
- ONE-SPACE BOUNDED ALGORITHMS FOR TWO-DIMENSIONAL BIN PACKING (Q3069730) (← links)
- Packing Rectangles into 2OPT Bins Using Rotations (Q3512468) (← links)
- Perfectly packing a cube by cubes of nearly harmonic sidelength (Q6052812) (← links)
- Filling space with hypercubes of two sizes – The pythagorean tiling in higher dimensions (Q6074962) (← links)
- Packing a triangle by equilateral triangles of harmonic sidelengths (Q6080241) (← links)
- Packing squares into a rectangle with a relatively small area (Q6098932) (← links)
- A simple method for perfect packing of squares of sidelengths \(n^{-1/2-\epsilon}\) (Q6169837) (← links)
- Packing a tetrahedron by similar tetrahedra (Q6181343) (← links)
