𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Asymptotic Worst-Case Behavior of the FFD Heuristic for Small Items

✍ Scribed by Kaihong Xu

Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
87 KB
Volume
37
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.

✦ Synopsis

The First-Fit-Decreasing FFD algorithm is one of the most famous and most studied methods for an approximative solution of the bin-packing problem. The question on the parametric behavior of the FFD heuristic for small items was Ε½ .

πŸ“œ SIMILAR VOLUMES

On the Asymptotic Worst Case Behavior of
On the Asymptotic Worst Case Behavior of Harmonic Fit
✍ AndrΓ© van Vliet πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 219 KB

In the parametric bin packing problem we must pack a list of items with size smaller than or equal to 1rr in a minimal number of unit-capacity bins. Among the Ε½ . approximation algorithms, the class of Harmonic Fit algorithms HF plays an M

Global Existence and Asymptotic Behavior
Global Existence and Asymptotic Behavior for the Radially Symmetric Case of a Two-Phase Stefan Problem with Interfacial Energy
✍ Giuseppe Scianna πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 365 KB

This paper is concerned with global existence in time and asymptotic behavior for the radially symmetric case of a Stefan problem with surface tension effects on the interface, according to the static Gibbs᎐Thomson law. These problems arise in phase change theory.