Average-case analysis of rectangle packings

DOI10.1007/10719839_30MaRDI QIDQ4508386zbMATH OpenFDO

Authors George S. Lueker, Peter Winkler, E. G. jun. Coffman, Joel Spencer

Publication date 3 October 2000

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

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

zbMATH Keywords

rectangle packings

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Nonnumerical algorithms (68W05)

Recommendations

• Packing random rectangles
• Packing Random Rectangles of Given Volume
• Packings in two dimensions: Asymptotic average-case analysis of algorithms
• Expected wasted space of optimal simple rectangle packing
• Maximal Empty Boxes Amidst Random Points

Cited in

(6)

• Expected wasted space of optimal simple rectangle packing
• Expected measure of the union of random rectangles
• scientific article; zbMATH DE number 1303568 (Why is no real title available?)
• Average-case analyses of first fit and random fit bin packing
• The Maximum of a Random Walk and Its Application to Rectangle Packing
• Packing Random Rectangles of Given Volume

This page was built for publication: Average-case analysis of rectangle packings

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