Pages that link to "Item:Q3638877"
From MaRDI portal
The following pages link to Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems (Q3638877):
Displaying 20 items.
- New approximability results for two-dimensional bin packing (Q261358) (← links)
- A new lower bound for online strip packing (Q322552) (← links)
- Polynomial-time approximation schemes for circle and other packing problems (Q329299) (← links)
- A \((5/3+\varepsilon)\)-approximation for strip packing (Q390133) (← links)
- Offline first-fit decreasing height scheduling of power loads (Q1707831) (← links)
- New upper bounds for online strip packing (Q1751205) (← links)
- An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing (Q1870001) (← 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)
- Absolute approximation ratios for packing rectangles into bins (Q2434269) (← links)
- On the Approximability of Orthogonal Order Preserving Layout Adjustment (Q3449805) (← links)
- New Approximability Results for 2-Dimensional Packing Problems (Q3525560) (← 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)
- An improved approximation for packing big two-bar charts (Q6187994) (← links)
