It is shown that under certain side conditions the natural random greedy algorithm almost always provides an asymptotically optimal packing of disjoint hyperedges from a hypergraph H .
No takes yet. Share an insight, caveat, or question.
Joel Spencer (1995) studied this question.
Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context: