Asymptotic packing via a branching process

Authors:
Joel Spencer
Affiliations:
Courant Institute of Mathematical Sciences, New York University, NY 10012
Venue:
Random Structures & Algorithms
Year:
1995

Citing 0
Cited 2

Inapproximability of b-matching in k-uniform hypergraphs

WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
Erdős magic

FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

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. © 1995 Wiley Periodicals, Inc.