A 2.5 times optimal algorithm for packing in two dimensions
From MaRDI portal
Publication:1135860
DOI10.1016/0020-0190(80)90121-0zbMath0426.05023MaRDI 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
68Q25: Analysis of algorithms and problem complexity
05B40: Combinatorial aspects of packing and covering
68R99: Discrete mathematics in relation to computer science
Related Items
On-line bin packing ? A restricted survey, Probabilistic analysis of shelf algorithms for strip packing, An effective approximation algorithm for the malleable parallel task scheduling problem, Recent advances on two-dimensional bin packing problems, Scheduling parallel jobs to minimize the makespan, 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, Knowledge based approach to the cutting stock problem, On genetic algorithms for the packing of polygons, Multiple-type, two-dimensional bin packing problems: Applications and algorithms, The two-dimensional cutting stock problem revisited, Two-dimensional packing problems: a survey, The nesting problem in the leather manufacturing industry, Greed in resource scheduling, Exhaustive approaches to 2D rectangular perfect packings, Approximation Algorithms for Maximizing the Number of Squares Packed into a Rectangle, Efficiency of two classes of dynamic scheduling algorithms in multiprocessor computer systems
Cites Work
