Pages that link to "Item:Q4575686"
From MaRDI portal
The following pages link to On approximating strip packing with a better ratio than 3/2 (Q4575686):
Displaying 11 items.
- A \((5/3+\varepsilon)\)-approximation for strip packing (Q390133) (← 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)
- Approximate strip packing: revisited (Q2629852) (← links)
- Hardness of Approximation for Strip Packing (Q4973891) (← 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)
- Peak demand minimization via sliced strip packing (Q6066765) (← links)
- A Tight (3/2+ε) Approximation for Skewed Strip Packing. (Q6084400) (← links)
- An improved approximation algorithm for scheduling monotonic moldable tasks (Q6106483) (← links)