Algorithmic construction of sets for k-restrictions

ACM Transactions on Algorithms

Volumn 2, Issue 2, 2006, Pages 153-177

  Alon, Noga ^a   Moshkovitz, Dana ^b   Safra, Shmuel ^a  

^a TEL AVIV UNIVERSITY   (Israel)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Almost k wise independence; Derandomization; Generalized hashing; Group testing; k restriction; Set Cover; Splitter

Indexed keywords

ALMOST K-WISE INDEPENDENCE; DERANDOMIZATION; GENERALIZED HASHING; GROUP TESTING; K-RESTRICTION; SET-COVER; SPLITTER;

ALGORITHMS; APPROXIMATION THEORY; COMBINATORIAL MATHEMATICS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

COMPUTER SCIENCE;

EID: 33747718071     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1150334.1150336     Document Type: Article

References (25)

1. ALON, N. 1987. Splitting necklaces. Adv. Math. 63, 3, 247-253.
2. ALON, N., BRUCK, J., NAOR, J., NAOR, M., AND ROTH, R. 1992. Construction of asymptotically good, low-rate error-correcting codes through pseudo-random graphs. IEEE Trans. Inf. Theory 38, 509-516.
3. ALON, N., COHEN, G., KRIVELEVICH, M., AND LITSYN, S. 2003. Generalized hashing and parent-identifying codes. J. Combinat. Theory, Ser. A 104, 207-215.
4. ALON, N., GOLDREICH, O., HÅST AD, J., AND PERALTA, R. 1990. Simple constructions of almost k-wise independent random variables. In Proceedings of the 31st IEEE Symposium on Foundations of Computer Science. Vol. 2. IEEE Computer Society Press, Los Alamitos, CA, 544-553.
5. ALON, N., YUSTER, R., AND ZWICK, U. 1994. Color-coding. Electronic Colloquium on Computational Complexity (ECCC) 1, 009.
6. (Full paper appears in J. ACM 42,4 (July 1995), 844-856).
7. ARORA, S., AND SAFRA, S. 1998. Probabilistic checking of proofs: A new characterization of NP. J. ACM 45, 1, 70-122.
8. ARORA, S., AND SUDAN, M. 1997. Improved low-degree testing and its applications. In Proceedings of the 29th ACM Symposium on Theory of Computing. ACM, New York, 485-495.
9. BELLARE, M., GOLDWASSER, S., LUND, C., AND RUSSELL, A. 1993. Efficient multi-prover interactive proofs with applications to approximation problems. In Proceedings of the 25th ACM Symposium on Theory of Computing. ACM, New York, 113-131.
10. COOK, S. A. 1971. The complexity of theorem-proving procedures. In Proceedings of the 3rd ACM Symposium on Theory of Computing. ACM, New York, 151-158.
11. DINUR, I., FISCHER, E., KINDLER, G., RAZ, R., AND SAFRA, S. 1999. PCP characterizations of NP: Towards a polynomially-small error-probability. In Proceedings of the 31st ACM Symposium on Theory of Computing. ACM, New York, 29-40.
12. DU, D. Z., AND HWANG, F. K. 2000. Combinatorial Group Testing and its Applications, second ed. Series on Applied Mathematics, vol. 12. World Scientific, New York.
13. EVEN, G., GOLDREICH, O., LUBY, M., NISAN, N., AND VELICKOVIC, B. 1998. Efficient approximation of product distributions. Rand. Struct. Algor. 13, 1, 1-16.
14. FEIGE, U. 1998. A threshold of In n for approximating set cover. J. ACM 45, 4, 634-652.
15. KOLLER, D., AND MEGIDDO, N. 1993. Constructing small sample spaces satisfying given constraints. Proceedings of the 25th ACM Symposium on Theory of Computing, ACM, New York, 268-277.
16. LOVÁSZ, L. 1975. On the ratio of optimal integral and fractional covers. Disc. Math. 13, 383-390.
17. LUND, C., AND YANNAKAKIS, M. 1994. On the hardness of approximating minimization problems. J. ACM 41, 5, 960-981.
18. NAOR, J., AND NAOR, M. 1993. Small-bias probability spaces: Efficient constructions and applications. SIAM J. Comput. 22, 4, 838-856.
19. NAOR, M., SCHULMAN, L. J., AND SRINIVASAN, A. 1995. Splitters and near-optimal derandomization. In Proceedings of the 36th IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 182-191.
20. NGO, H. Q., AND DU, D. Z. 2000. A Survey on Combinatorial Group Testing Algorithms with Applications to DNA Library Screening. DIMACS Series on Discrete Mathematics Theoretical Compuer Science, vol. 55. Amer. Math. Soc., 171-182.
21. RAZ, R., AND SAFRA, S. 1997. A sub-constant error-probability PCP characterization of NP. In Proceedings of the 29th ACM Symposium on Theory of Computing. ACM, New York, 475-484.
22. SLAVIK, P. 1996. A tight analysis of the greedy algorithm for set cover. In Proceedings of the 28th ACM Symposium on Theory of Computing. ACM, New York, 435-441.
23. SRINIVASAN, A. 1999. Improved approximations guarantees for packing and covering integer programs. SIAM J. Comput. 29, 2, 648-670.
24. (Preliminary version in Proc. STOC 95.)
25. VANLEEUWEN, J. 1990. Graph Algorithms, Handbook of Theoretical Computer Science (1. Van Leeuwen, Ed.). Vol. A (Algorithms and Complexity). Chap. 10, MIT Press, Cambridge, MA, 525-631.