Asymptotically optimal covering designs

Journal of Combinatorial Theory. Series A

Volumn 75, Issue 2, 1996, Pages 270-280

  Gordon, Daniel M ^a   Patashnik, Oren ^a   Kuperberg, Greg ^b   Spencer, Joel H ^c  

^a CENTER FOR COMMUNICATIONS RESEARCH   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030210611     PISSN: 00973165     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcta.1996.0077     Document Type: Article

References (8)

1. 1. N. ALON AND J. H. SPENCER, The Probabilistic Method, Section 9.4, Wiley, New York, 1992.
2. 2. G. BRASSARD AND S. KANNAN, The generation of random permutations on the fly, Inform. Proc. Lett. 28 (1988), 207-212.
3. 3. P. ERDOS AND H. HANANI, On a limit theorem in combinatorical analysis, Publ. Math. Debrecen 10 (1963), 10-13.
4. 4. D. M. GORDON, G. KUPERBERG, AND O. PATASHNIK, New constructions for covering designs, J. Combin. Designs 3 (1995), 269-284.
5. 5. V. RÖDL, On a packing and covering problem, European J. Combin. 5 (1985), 69-78.
6. 6. V. RÖDL AND L. THOMA, Asymptotic packing and the random greedy algorithm, Random Structures Algorithms 8 (1996), 161-177.
7. 7. J. SCHÖNHEIM, On coverings, Pacific J. Math. 14 (1964), 1405-1411.
8. 8. J. SPENCER, Asymptotic packing via a branching process, Random Structures Algorithms 7 (1995), 167-172.