✦ LIBER ✦

The greedy algorithm for partially ordered sets

✍ Scribed by Ulrich Faigle

Publisher: Elsevier Science
Year: 1979
Tongue: English
Weight: 756 KB
Volume: 28
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(79)90092-x

No coin nor oath required. For personal study only.

✦ Synopsis

Those independence systems on finite partially ordered sets are characterized for which the greedy algorithm always works.

'Fhe greedy ulgsrithm far gtartIally ordered fete

📜 SIMILAR VOLUMES

Some optimal algorithms for decomposed p

Some optimal algorithms for decomposed partially ordered sets

✍ Vijay K. Garg 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 428 KB

The morphology of partially ordered sets

✍ L.H Harper 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 674 KB

A Tutte Polynomial for Partially Ordered

A Tutte Polynomial for Partially Ordered Sets

✍ G. Gordon 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 930 KB

On the dimension of partially ordered se

On the dimension of partially ordered sets

✍ Oliver Pretzel 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 372 KB

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

Linear Inequalities for Flags in Graded

Linear Inequalities for Flags in Graded Partially Ordered Sets

✍ Louis J. Billera; Gábor Hetyei 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 264 KB