Asymptotic packing via a branching process

Authors:
Joel Spencer
Affiliations:
New York Univ., New York, NY
Venue:
Random Structures & Algorithms
Year:
1995

Citing 0
Cited 2

Explicit Constructions of Rödl's Asymptotically Good Packings and Coverings

Combinatorics, Probability and Computing
Experimental Study of Non-oblivious Greedy and Randomized Rounding Algorithms for Hypergraph b-Matching

SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract