Abstract
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) |
---|---|
Pages (from-to) | 167-172 |
Number of pages | 6 |
Journal | Random Structures & Algorithms |
Volume | 7 |
Issue number | 2 |
DOIs | |
State | Published - Sep 1995 |
ASJC Scopus subject areas
- Software
- General Mathematics
- Computer Graphics and Computer-Aided Design
- Applied Mathematics