𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A linear time bin-packing algorithm

✍ Scribed by Charles U Martel

Publisher
Elsevier Science
Year
1985
Tongue
English
Weight
244 KB
Volume
4
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A 5/4 Linear Time Bin Packing Algorithm
A 5/4 Linear Time Bin Packing Algorithm
✍ JΓ³zsef BΓ©kΓ©si; GΓ‘bor Galambos; Hans Kellerer πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 195 KB

In 1985, Martel published a linear time algorithm with a 4 3 asymptotic worst-case ratio for the one-dimensional bin packing problem. The algorithm is based on a linear time classification of the sizes of the items, and thereafter according to the number of elements in certain subclasses pairing the

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.

A polynomial time circle packing algorit
A polynomial time circle packing algorithm
✍ Bojan Mohar πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 428 KB

Mohar, B., A polynomial time circle packing algorithm, Discrete Mathematics 117 (1993) 2577263. The Andreev-Koebe-Thurston circle packing theorem is generalized and improved in two ways. Simultaneous circle packing representations of the map and its dual map are obtained such that any two edges dua