Pages that link to "Item:Q5383961"
From MaRDI portal
The following pages link to Improved Approximation Algorithm for Two-Dimensional Bin Packing (Q5383961):
Displayed 16 items.
- New approximability results for two-dimensional bin packing (Q261358) (← links)
- Polynomial-time approximation schemes for circle and other packing problems (Q329299) (← links)
- On the number of anchored rectangle packings for a planar point set (Q344784) (← links)
- Online square-into-square packing (Q521815) (← links)
- Anchored rectangle and square packings (Q1751252) (← links)
- Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
- Online circle and sphere packing (Q2419121) (← links)
- Approximating Smallest Containers for Packing Three-Dimensional Convex Objects (Q3177900) (← links)
- On the Number of Anchored Rectangle Packings for a Planar Point Set (Q3196400) (← links)
- On the complexity of anchored rectangle packing (Q5075741) (← links)
- Closing the Gap for Pseudo-Polynomial Strip Packing (Q5075807) (← links)
- A tight \((3/2+\varepsilon)\)-approximation for skewed strip packing (Q6046946) (← links)
- Tight approximation algorithms for geometric bin packing with skewed items (Q6053472) (← links)
- Peak demand minimization via sliced strip packing (Q6066765) (← links)
- A Tight (3/2+ε) Approximation for Skewed Strip Packing. (Q6084400) (← links)
- On Guillotine Separability of Squares and Rectangles. (Q6084407) (← links)