Maximizing the number of packed rectangles

DOI10.1007/978-3-540-27810-8_31MaRDI QIDQ5315388zbMATH OpenOpenAlexFDO

Authors Klaus Jansen, Guochuan Zhang

Publication date 7 September 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b98413

Mathematics Subject Classification ID

Approximation algorithms (68W25) Combinatorial optimization (90C27)

Recommendations

• Approximation Algorithms for Maximizing the Number of Squares Packed into a Rectangle
• On rectangle packing, maximizing benefits
• Maximizing the total profit of rectangles packed into a rectangle
• An approximation algorithm for square packing.
• On packing squares into a rectangle

Cited in

(27)

• Approximation algorithms for orthogonal packing problems for hypercubes
• Worst-case analysis of fast heuristics for packing squares into a square
• -soft packings of rectangles
• Planar maximum-box problem revisited
• Approximation and online algorithms for multidimensional bin packing: a survey
• Almost square packing
• Approximation Algorithms for Maximizing the Number of Squares Packed into a Rectangle
• Minimum boundary touching tilings of polyominoes
• 2D knapsack: packing squares
• Mathematical Foundations of Computer Science 2005
• PACKING SOFT RECTANGLES
• On rectangle packing, maximizing benefits
• Algorithms and Computation
• Chips on wafers (extended abstract)
• Breaking the barrier of 2 for the storage allocation problem
• On the two-dimensional knapsack problem for convex polygons
• Approximating the geometric knapsack problem in near-linear time and dynamically
• Structure of polynomial-time approximation
• On the two-dimensional knapsack problem for convex polygons
• Chips on wafers, or packing rectangles into grids
• Improved approximation algorithms for 2-dimensional knapsack: packing into multiple l-shapes, spirals, and more
• Rectangle packing with one-dimensional resource augmentation
• Maximizing the throughput of parallel jobs on hypercubes
• Packing into the smallest square: worst-case analysis of lower bounds
• Maximizing the total profit of rectangles packed into a rectangle
• On the complexity of sequential rectangle placement in IEEE 802.16/WiMAX systems
• An approximation algorithm for sequential rectangle placement

This page was built for publication: Maximizing the number of packed rectangles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5315388)