𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A heuristic approximation of the worst case of Shellsort

✍ Scribed by Hannu Erkiö

Publisher
Springer Netherlands
Year
1980
Tongue
English
Weight
423 KB
Volume
20
Category
Article
ISSN
0006-3835

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Worst-case analysis of scheduling heuris
Worst-case analysis of scheduling heuristics of parallel systems
✍ Zhen Liu 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 374 KB

It is well-known that most scheduling problems arising from parallel systems are N N P P-hard, even under very special assumptions. Thus, various suboptimal algorithms, in particular heuristics, were proposed in the literature. Worst-case error bounds are established in this paper for heuristics of

The Asymptotic Worst-Case Behavior of th
The Asymptotic Worst-Case Behavior of the FFD Heuristic for Small Items
✍ Kaihong Xu 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 87 KB

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 Ž .