𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Lower bounds for on-line two-dimensional packing algorithms

✍ Scribed by Donna J. Brown; Brenda S. Baker; Howard P. Katseff

Publisher
Springer-Verlag
Year
1982
Tongue
English
Weight
663 KB
Volume
18
Category
Article
ISSN
0001-5903

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Shelf algorithms for on-line strip packi
Shelf algorithms for on-line strip packing
✍ JΓ‘nos Csirik; Gerhard J. Woeginger πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 461 KB

In the strip packing problem, the goal is to pack a set of rectangles into a vertical strip of unit width so as to minimize the total height of the strip needed. For the on-line version of this problem, Baker and Schwarz introduced the class of so-called shelf algorithms. One of these shelf algorith

A new lower bound for the non-oriented t
A new lower bound for the non-oriented two-dimensional bin-packing problem
✍ FranΓ§ois Clautiaux; Antoine Jouglet; Joseph El Hayek πŸ“‚ Article πŸ“… 2007 πŸ› Elsevier Science 🌐 English βš– 183 KB

We propose a new scheme for computing lower bounds for the non-oriented bin-packing problem when the bin is a square. It leads to bounds that theoretically dominate previous results. Computational experiments show that the bounds are tight. We also discuss the case where the bin is not a square.

Lower bounds for on-line graph coloring
Lower bounds for on-line graph coloring
✍ Magnus M. HalldΓ³rsson; Mario Szegedy πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 771 KB
A 54 algorithm for two-dimensional packi
A 54 algorithm for two-dimensional packing
✍ Brenda S Baker; Donna J Brown; Howard P Katseff πŸ“‚ Article πŸ“… 1981 πŸ› Elsevier Science 🌐 English βš– 1002 KB