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 Ž .
On the Asymptotic Worst Case Behavior of Harmonic Fit
✍ Scribed by André van Vliet
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 219 KB
- Volume
- 20
- Category
- Article
- ISSN
- 0196-6774
No coin nor oath required. For personal study only.
✦ Synopsis
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
📜 SIMILAR VOLUMES
We study a second order ordinary differential equation which is the EulerLagrange equation of the energy functional for maps with prescribed rotational symmetry. We obtain Liouville's type theorems for symmetric harmonic maps into ellipsoids, Euclidean and Hyperbolic spaces, and existence results as
In this paper, the asymptotic optimality of the cross validation bandwidth selector for the local polynomial fitting under strongly mixing dependence is obtained. The asymptotic normality of the bandwidth selected by the cross-validation method is derived, which is an extension of W.