Pages that link to "Item:Q5915576"
From MaRDI portal
The following pages link to Complexity and inapproximability results for parallel task scheduling and strip packing (Q5915576):
Displaying 8 items.
- Exact solution techniques for two-dimensional cutting and packing (Q2029021) (← links)
- Improved approximation for two dimensional strip packing with polynomial bounded width (Q2272375) (← links)
- Closing the Gap for Pseudo-Polynomial Strip Packing (Q5075807) (← links)
- (Q5919458) (redirect page) (← 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)
