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.
|Original language||English (US)|
|Number of pages||6|
|Journal||Random Structures & Algorithms|
|State||Published - Sep 1995|
ASJC Scopus subject areas
- Computer Graphics and Computer-Aided Design
- Applied Mathematics