Nearly-perfect hypergraph packing is in NC

Information Processing Letters

Volumn 60, Issue 6, 1996, Pages 295-299

  Grable, David A ^a  

^a HUMBOLDT UNIVERSITY   (Germany)

Author keywords

Algorithms; Computational complexity

Indexed keywords

EID: 0001298442     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(96)00181-0     Document Type: Article

References (17)

1. N. Alon, L. Babai and A. Itai, A fast and simple randomized algorithm for the maximal independent set problem, J. Algorithms 7 (1986) 567-583.
2. T. Beth, D. Jungnickel and H. Lenz, Design Theory (Cambridge University Press, Cambridge, MA, 1986).
3. P. Erdos and H. Hanani, On a limit theorem in combinatorial analysis, Publ. Math. Debrecen 10 (1963) 10-13.
4. [4 ] G. Even, O. Goldreich, M. Luby, N. Nisan and B. Veličković, Approximations of general independent distributions, in: Proc. ACM Symp. on the Theory of Computing (1992) 10-16.
5. P. Frankl and V. Rödl, Near perfect coverings in graphs and hypergraphs, European J. Combin. 6 (1985) 317-326.
6. Z. Füredi, Matchings and coverings in hypergraphs, Graphs and Combinatorics 4 (1988) 115-206.
7. D.A. Grable, More-than-nearly-perfect packings and partial designs, Preprint, 1994.
8. R.M. Karp, Reducibilty among combinatorial problems, in: R.E. Miller and J.W. Thatcher, eds., Complexity of Computer Computations (Plenum Press, New York, 1972) 85-103.
9. R.M. Karp and V. Ramachandran, Parallel algorithms for shared-memory machines, in: J. van Leeuwen, ed., Handbook of Theoretical Computer Science (Elsevier, Amsterdam, 1990) 869-942.
10. R.M. Karp, E. Upfal and A. Wigderson, Constructing a perfect matching is in random NC, Combinatorica 6 (1986) 35-48.
11. R.M. Karp and A. Wigderson, A fast parallel algorithm for the maximal independent set problem, J. ACM 32 (1985) 762-773.
12. M. Luby, A simple parallel algorithm for the maximal independent set problem, SIAM J. Comput. 15 (1986) 1036-1053.
13. N. Pippenger and J. Spencer, Asymptotic behavior of the chromatic index for hypergraphs, J. Combin. Theory Ser. A 51 (1989) 24-42.
14. V. Rödl, On a packing and covering problem, European J. Combin. 5 (1985) 69-78.
15. V. Rödl and L. Thoma, Asymptotic packing and the random greedy algorithm, Random Structures and Algorithms 8 (1996) 161-177.
16. V. Rödl and L. Thoma, Talk at The 7th Internat. Conf. on Random Structures and Algorithms, Atlanta, 1995.
17. J.P. Schmidt, A. Siegel and A. Srinivasan, Chernoff-Hoeffding bounds for applications with limited independence, SIAM J. Discrete Math. 8 (1995) 223-250.