A 2.5 times optimal algorithm for packing in two dimensions
From MaRDI portal
Cites work
Cited in
(35)- Closing the Gap for Pseudo-Polynomial Strip Packing
- New upper bounds for online strip packing
- Exhaustive approaches to 2D rectangular perfect packings
- A tight \((3/2+\varepsilon)\)-approximation for skewed strip packing
- A Tight (3/2+ε) Approximation for Skewed Strip Packing.
- A \((5/3+\varepsilon)\)-approximation for strip packing
- An improved approximation for packing big two-bar charts
- A posteriori analysis of the algorithms for two-bar charts packing problem
- On genetic algorithms for the packing of polygons
- An effective approximation algorithm for the malleable parallel task scheduling problem
- Recent advances on two-dimensional bin packing problems
- The nesting problem in the leather manufacturing industry
- Approximation and online algorithms for multidimensional bin packing: a survey
- Peak demand minimization via sliced strip packing
- A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem
- New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
- An improved approximation algorithm for scheduling monotonic moldable tasks
- A new lower bound for online strip packing
- On-line bin packing ? A restricted survey
- Polynomial-time approximation schemes for circle and other packing problems
- Two-bar charts packing problem
- On dynamic task scheduling for FPGA-based systems
- Improved upper bounds for online malleable job scheduling
- Approximation Algorithms for Maximizing the Number of Squares Packed into a Rectangle
- Two-dimensional packing problems: a survey
- Online square packing with gravity
- Greed in resource scheduling
- Scheduling parallel jobs to minimize the makespan
- Efficiency of two classes of dynamic scheduling algorithms in multiprocessor computer systems
- Knowledge based approach to the cutting stock problem
- Multiple-type, two-dimensional bin packing problems: Applications and algorithms
- High multiplicity strip packing with three rectangle types
- The two-dimensional cutting stock problem revisited
- Malleable scheduling for flows of jobs and applications to MapReduce
- Probabilistic analysis of shelf algorithms for strip packing
This page was built for publication: A 2.5 times optimal algorithm for packing in two dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1135860)
