Asymptotic packing via a branching process
Author:
- 1 September 1995
- journal article
- research article
- Published by Wiley in Random Structures & Algorithms
- Vol. 7 (2) , 167-172
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.Keywords
This publication has 2 references indexed in Scilit:
- Asymptotic behavior of the chromatic index for hypergraphsJournal of Combinatorial Theory, Series A, 1989
- On a Packing and Covering ProblemEuropean Journal of Combinatorics, 1985