✦ LIBER ✦

Worst case analysis of a class of set covering heuristics

✍ Scribed by Andrew C. Ho

Publisher: Springer-Verlag
Year: 1982
Tongue: English
Weight: 366 KB
Volume: 23
Category: Article
ISSN: 0025-5610
DOI: 10.1007/bf01583786

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Worst-case analysis of two travelling sa

Worst-case analysis of two travelling salesman heuristics

✍ Hoon Liong Ong; J.B. Moore 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 463 KB

A modified greedy heuristic for the Set

A modified greedy heuristic for the Set Covering problem with improved worst case bound

✍ Olivier Goldschmidt; Dorit S. Hochbaum; Gang Yu 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 458 KB

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

Worst-case analysis of heuristics for op

Worst-case analysis of heuristics for open shops with parallel machines

✍ Bo Chen; Vitaly A. Strusevich 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 623 KB

Worst-case analysis of heuristics for th

Worst-case analysis of heuristics for the local microcode optimization problem

✍ Axel Böttcher; Gisbert Lawitzky; Hans-Ulrich Simon 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 383 KB

A heuristic approximation of the worst c

A heuristic approximation of the worst case of Shellsort

✍ Hannu Erkiö 📂 Article 📅 1980 🏛 Springer Netherlands 🌐 English ⚖ 423 KB