scientific article; zbMATH DE number 4198016

MaRDI QIDQ5203023zbMATH OpenFDO

Authors G. Bär

Publication date 1990

zbMATH Keywords

asymptoticminimize the height of the arrangementpacking by rectanglespacking problemperformance bounds

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40)

Recommendations

• On Two Dimensional Packing
• On two dimensional packing
• Packing Rectangles into 2OPT Bins Using Rotations
• LATIN 2004: Theoretical Informatics
• Resource augmentation in two-dimensional packing with orthogonal rotations

Cited in

(11)

• Oriented aligned rectangle packing problem
• Resource augmentation in two-dimensional packing with orthogonal rotations
• Packing Rectangles into 2OPT Bins Using Rotations
• scientific article; zbMATH DE number 19811 (Why is no real title available?)
• Performance Bound for Bottom-Left Guillotine Packing of Rectangles
• On Two Dimensional Packing
• Packing \(n\)-dimensional parallelepipeds with the feasibility of changing their orthogonal orientation in an \(n\)-dimensional parallelepiped
• On two dimensional packing
• Mathematical Foundations of Computer Science 2003
• Approximation and Online Algorithms
• Packing into the smallest square: worst-case analysis of lower bounds

This page was built for publication:

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