Pages that link to "Item:Q4973891"
From MaRDI portal
The following pages link to Hardness of Approximation for Strip Packing (Q4973891):
Displaying 9 items.
- Complexity results for the horizontal bar packing problem (Q975490) (← links)
- Approximate strip packing: revisited (Q2629852) (← links)
- The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview (Q2669629) (← 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)
- Approximation Algorithms for Demand Strip Packing (Q6090894) (← links)