𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The greedy load sharing algorithm

✍ Scribed by Shyamal Chowdhury


Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
788 KB
Volume
9
Category
Article
ISSN
0743-7315

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Asymptotic packing and the random greedy
✍ 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

The greedy algorithm for partially order
✍ 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