The following pages link to Online square and cube packing (Q2570973):
Displayed 18 items.
- On-line algorithms for 2-space bounded 2-dimensional bin packing (Q456101) (← links)
- Online square packing with gravity (Q476449) (← links)
- Online square-into-square packing (Q521815) (← links)
- Dynamic multi-dimensional bin packing (Q616986) (← links)
- A note on online hypercube packing (Q623793) (← links)
- Online removable square packing (Q927402) (← links)
- Two-dimensional online bin packing with rotation (Q982663) (← links)
- A new upper bound for the online square packing problem in a strip (Q2012894) (← links)
- A lower bound for online rectangle packing (Q2331592) (← links)
- Packing cubes into a cube is NP-complete in the strong sense (Q2354306) (← links)
- Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity (Q2373445) (← 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)
- ONE-SPACE BOUNDED ALGORITHMS FOR TWO-DIMENSIONAL BIN PACKING (Q3069730) (← links)
- Packing Cubes into a Cube in (D>3)-Dimensions (Q3196389) (← links)
- Online bin packing of squares and cubes (Q5896890) (← links)
- Lower bounds for several online variants of bin packing (Q5915655) (← links)
- Online bin packing of squares and cubes (Q5925713) (← links)