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

A 54 algorithm for two-dimensional packing

โœ Scribed by Brenda S Baker; Donna J Brown; Howard P Katseff

Publisher
Elsevier Science
Year
1981
Tongue
English
Weight
1002 KB
Volume
2
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A 3-approximation algorithm for two-dime
A 3-approximation algorithm for two-dimensional bin packing
โœ Guochuan Zhang ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 189 KB

In the classical two-dimensional bin packing problem one is asked to pack a set of rectangular items, without overlap and without any rotation, into the minimum number of identical square bins. We give an approximation algorithm with absolute worst-case ratio of 3.

An Efficient Processor Allocation Algori
An Efficient Processor Allocation Algorithm Using Two-Dimensional Packing
โœ Injae Hwang ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 122 KB

Mesh is one of the most widely used interconnection networks for multiprocessor systems. In this paper, we propose an approach to partition a given mesh into m submeshes which can be allocated to m tasks with grid structures. We adapt twodimensional packing to solve the submesh allocation problem. D