𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The canonical order and greedy algorithms

✍ Scribed by M.M. Kovalev; D.M. Vasilkov

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
220 KB
Volume
80
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

πŸ“œ 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

The greedy load sharing algorithm
The greedy load sharing algorithm
✍ Shyamal Chowdhury πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 788 KB
Asymptotic packing and the random greedy
Asymptotic packing and the random greedy algorithm
✍ VojtΔ›ch RΓΆdl; LuboΕ‘ Thoma πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 593 KB

Let H be an r-uniform hypergraph satisfying deg(x) = D(l + o( 1)) for each vertex x E V ( H ) and deg(x, y) = o ( D ) for each pair of vertices x, y E V ( H ) , where D+=. Recently, J . Spencer [5] showed, using a branching process approach, that almost surely the random greedy algorithm finds a pac