Pages that link to "Item:Q3222847"
From MaRDI portal
The following pages link to Approximation Algorithms for Maximizing the Number of Squares Packed into a Rectangle (Q3222847):
Displayed 8 items.
- 2D knapsack: packing squares (Q388093) (← links)
- Rectangle packing with one-dimensional resource augmentation (Q834190) (← links)
- Hardness of approximation for orthogonal rectangle packing and covering problems (Q1026242) (← links)
- Oriented aligned rectangle packing problem (Q1196022) (← links)
- Packing problems (Q1197916) (← links)
- A lower bound for the non-oriented two-dimensional bin packing problem (Q1348248) (← links)
- Cube packing. (Q1401310) (← links)
- PACKING SOFT RECTANGLES (Q5493900) (← links)