Pages that link to "Item:Q390133"
From MaRDI portal
The following pages link to A \((5/3+\varepsilon)\)-approximation for strip packing (Q390133):
Displaying 22 items.
- Packing anchored rectangles (Q276437) (← links)
- A new lower bound for online strip packing (Q322552) (← links)
- On the number of anchored rectangle packings for a planar point set (Q344784) (← links)
- Online square-into-square packing (Q521815) (← links)
- On contiguous and non-contiguous parallel task scheduling (Q892906) (← links)
- iGreen: green scheduling for peak demand minimization (Q1675631) (← links)
- New upper bounds for online strip packing (Q1751205) (← links)
- Two-bar charts packing problem (Q2047190) (← links)
- Improved approximation for two dimensional strip packing with polynomial bounded width (Q2272375) (← links)
- Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
- On the Number of Anchored Rectangle Packings for a Planar Point Set (Q3196400) (← links)
- On the Approximability of Orthogonal Order Preserving Layout Adjustment (Q3449805) (← links)
- Approximating Minimum-Area Rectangular and Convex Containers for Packing Convex Polygons (Q3452765) (← links)
- (Q5002616) (← links)
- A Posteriori Analysis of the Algorithms for Two-Bar Charts Packing Problem (Q5054168) (← links)
- Closing the Gap for Pseudo-Polynomial Strip Packing (Q5075807) (← links)
- Complexity and inapproximability results for parallel task scheduling and strip packing (Q5915576) (← links)
- A tight \((3/2+\varepsilon)\)-approximation for skewed strip packing (Q6046946) (← links)
- A Tight (3/2+ε) Approximation for Skewed Strip Packing. (Q6084400) (← links)
- An improved approximation for packing big two-bar charts (Q6187994) (← links)
- A PTAS for the horizontal rectangle stabbing problem (Q6589763) (← links)
- (Re)packing equal disks into rectangle (Q6642301) (← links)