๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Packing rectangles in a strip

โœ Scribed by E.G. Coffman, Jr.; Peter J. Downey; Peter Winkler

Publisher
Springer-Verlag
Year
2002
Tongue
English
Weight
135 KB
Volume
38
Category
Article
ISSN
0001-5903

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An approximation scheme for strip packin
An approximation scheme for strip packing of rectangles with bounded dimensions
โœ W.Fernandez de La Vega; V. Zissimopoulos ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 597 KB

It is shown that for any positive E the strip-packing problem, i.e. the problem of packing a given list of rectangles into a strip of width 1 and minimum height. can be solled within I c 2: times the optimal height, in linear time, if the heights and widths of these rectangles are all bounded below

A new approach to rectangle-packing
A new approach to rectangle-packing
โœ Akira Nagao; Takashi Sawa; Yuji Shigehiro; Isao Shirakawa; Takashi Kambe ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 957 KB

The rectangle-packing problem is the problem of placing several given rectangles of arbitrary width and height into a minimum area rectangle without overlapping. This problem can be applied to VLSI packaging design, for which the area significantly affects the fabrication cost. Since this is an NP-h