Pages that link to "Item:Q3503847"
From MaRDI portal
The following pages link to A Polynomial Time Approximation Scheme for the Square Packing Problem (Q3503847):
Displayed 9 items.
- Packing anchored rectangles (Q276437) (← links)
- 2D knapsack: packing squares (Q388093) (← links)
- Online square-into-square packing (Q521815) (← links)
- Approximation algorithms for orthogonal packing problems for hypercubes (Q1035685) (← links)
- Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
- Two Dimensional Knapsack with Unloading Constraints (Q2840720) (← links)
- 2D Knapsack: Packing Squares (Q3004667) (← links)
- Two for One: Tight Approximation of 2D Bin Packing (Q3183471) (← links)
- Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack (Q5075797) (← links)