𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Improved performance of the greedy algorithm for partial cover

✍ Scribed by Petr Slavík

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
332 KB
Volume
64
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

✦ Synopsis

We prove that the classical bounds on the performance of the greedy algorithm for approximating MINIMUM COVER with costs are valid for PARTIAL. COVER as well, thus lowering, by more than a factor of two, the previously known estimate. In order to do so, we introduce a new simple technique that might be useful for attacking other similar problems. @

📜 SIMILAR VOLUMES

The greedy algorithm for partially order
The greedy algorithm for partially ordered sets
✍ Ulrich Faigle 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 756 KB

Those independence systems on finite partially ordered sets are characterized for which the greedy algorithm always works. 'Fhe greedy ulgsrithm far gtartIally ordered fete

A Tight Analysis of the Greedy Algorithm
A Tight Analysis of the Greedy Algorithm for Set Cover
✍ Petr Slavı́k 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 214 KB

We establish significantly improved bounds on the performance of the greedy algorithm for approximating set co¨er. In particular, we provide the first substantial Ž . improvement of the 20-year-old classical harmonic upper bound, H m , of Johnson, Lovasz, and Chvatal, by showing that the performance

Greedy Algorithm for Set Cover in Contex
Greedy Algorithm for Set Cover in Context of Knowledge Discovery Problems
✍ Mikhail Ju. Moshkov 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 750 KB

In the paper some problems connected with a process of knowledge discovery are considered. These problems are reduced to the set cover problem. It is known that under a plausible assumption on the class \(N P\) the greedy algorithm is close to best approximate polynomial algorithms for the set cover