Pages that link to "Item:Q1135860"
From MaRDI portal
The following pages link to A 2.5 times optimal algorithm for packing in two dimensions (Q1135860):
Displaying 36 items.
- 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)
- An effective approximation algorithm for the malleable parallel task scheduling problem (Q433456) (← links)
- Online square packing with gravity (Q476449) (← links)
- Recent advances on two-dimensional bin packing problems (Q697576) (← links)
- Scheduling parallel jobs to minimize the makespan (Q880560) (← links)
- Improved upper bounds for online malleable job scheduling (Q892840) (← links)
- A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem (Q1015322) (← links)
- New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems (Q1046097) (← links)
- Knowledge based approach to the cutting stock problem (Q1197096) (← links)
- On genetic algorithms for the packing of polygons (Q1266576) (← links)
- Multiple-type, two-dimensional bin packing problems: Applications and algorithms (Q1339128) (← links)
- New upper bounds for online strip packing (Q1751205) (← links)
- The two-dimensional cutting stock problem revisited (Q1774168) (← links)
- Two-dimensional packing problems: a survey (Q1847188) (← links)
- The nesting problem in the leather manufacturing industry (Q1897382) (← links)
- Two-bar charts packing problem (Q2047190) (← links)
- Improved approximation for two dimensional strip packing with polynomial bounded width (Q2272375) (← links)
- Greed in resource scheduling (Q2277135) (← links)
- Malleable scheduling for flows of jobs and applications to MapReduce (Q2304112) (← links)
- Exhaustive approaches to 2D rectangular perfect packings (Q2390210) (← links)
- Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
- Approximation Algorithms for Maximizing the Number of Squares Packed into a Rectangle (Q3222847) (← links)
- Efficiency of two classes of dynamic scheduling algorithms in multiprocessor computer systems (Q3747714) (← links)
- On-line bin packing ? A restricted survey (Q4845093) (← 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)
- ON DYNAMIC TASK SCHEDULING FOR FPGA-BASED SYSTEMS (Q5249284) (← links)
- Probabilistic analysis of shelf algorithms for strip packing (Q5491239) (← 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)