A 2.5 times optimal algorithm for packing in two dimensions
From MaRDI portal
Publication:1135860
DOI10.1016/0020-0190(80)90121-0zbMath0426.05023OpenAlexW2071027833MaRDI QIDQ1135860
Publication date: 1980
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(80)90121-0
Analysis of algorithms and problem complexity (68Q25) Combinatorial aspects of packing and covering (05B40) Discrete mathematics in relation to computer science (68R99)
Related Items
Multiple-type, two-dimensional bin packing problems: Applications and algorithms, A Posteriori Analysis of the Algorithms for Two-Bar Charts Packing Problem, The nesting problem in the leather manufacturing industry, A new lower bound for online strip packing, Polynomial-time approximation schemes for circle and other packing problems, Exhaustive approaches to 2D rectangular perfect packings, Approximation and online algorithms for multidimensional bin packing: a survey, Efficiency of two classes of dynamic scheduling algorithms in multiprocessor computer systems, Scheduling parallel jobs to minimize the makespan, On-line bin packing ? A restricted survey, A \((5/3+\varepsilon)\)-approximation for strip packing, Approximation Algorithms for Maximizing the Number of Squares Packed into a Rectangle, A tight \((3/2+\varepsilon)\)-approximation for skewed strip packing, Peak demand minimization via sliced strip packing, Improved upper bounds for online malleable job scheduling, An improved approximation algorithm for scheduling monotonic moldable tasks, High multiplicity strip packing with three rectangle types, An improved approximation for packing big two-bar charts, An effective approximation algorithm for the malleable parallel task scheduling problem, Online square packing with gravity, Knowledge based approach to the cutting stock problem, A Tight (3/2+ε) Approximation for Skewed Strip Packing., New upper bounds for online strip packing, Recent advances on two-dimensional bin packing problems, The two-dimensional cutting stock problem revisited, Improved approximation for two dimensional strip packing with polynomial bounded width, Complexity and inapproximability results for parallel task scheduling and strip packing, Greed in resource scheduling, Closing the Gap for Pseudo-Polynomial Strip Packing, Two-bar charts packing problem, A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem, Malleable scheduling for flows of jobs and applications to MapReduce, On genetic algorithms for the packing of polygons, Probabilistic analysis of shelf algorithms for strip packing, New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems, ON DYNAMIC TASK SCHEDULING FOR FPGA-BASED SYSTEMS, Two-dimensional packing problems: a survey
Cites Work
