A derandomization using min-wise independent permutations

Journal of Discrete Algorithms

Volumn 1, Issue 1, 2003, Pages 11-20

  Broder, Andrei Z ^a   Charikar, Moses ^b   Mitzenmacher, Michael ^c  

^a AltaVista Company   (United States)

^b Stanford University   (United States)

^c HARVARD UNIVERSITY   (United States)

Author keywords

Derandomization; Min wise independence; Parallel algorithms; Set cover

Indexed keywords

EID: 57349121454     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1570-8667(03)00003-0     Document Type: Article

References (14)

1. N. Alon, O. Goldreich, J. Håstad, R. Peralta, Simple constructions of almost k-wise independent random variables, Random Structures and Algorithms 3 (1992) 289-304.
2. A.Z. Broder, On the resemblance and containment of documents, in: Proceedings of Compression and Complexity of Sequences, IEEE Computer Society, 1997, pp. 21-29.
3. A.Z. Broder, Identifying and filtering near-duplicate documents, in: R. Giancarlo, D. Sankoff (Eds.), CPM Proceedings, in: Lecture Notes in Comput. Sci., Vol. 1848, Springer, Berlin, 1998, pp. 1-10, http://link.springer.de/link/ service/series/0558/bibs/1848/18480001.htm.
4. A.Z. Broder, M. Charikar, A. Frieze, M. Mitzenmacher, Min-wise independent permutations, in: Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998, pp. 327-336.
5. A.Z. Broder, S.C. Glassman, M.S. Manasse, G. Zweig, Syntactic clustering of the Web, in: Proceedings of the Sixth International World Wide Web Conference, 1997, pp. 391-404.
6. J.L. Carter, M.N. Wegman, Universal classes of hash functions, J. Comput. System Sci. 18 (1979) 143-154.
7. U. Feige, A threshold of In n for approximating set cover (preliminary version), in: Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, Philadelphia, PA, 1996, pp. 314-318.
8. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman and Company, New York, 1979.
9. P. Indyk, A small approximately min-wise independent family of hash functions, in: Proceedings of the Tenth Annual ACM Symposium on Discrete Algorithms, 1999, pp. 454-456.
10. R.M. Karp, Reducibility among combinatorial problems, in: R.E. Miller, J.W. Thatcher (Eds.), Complexity of Computer Computations, Plenum Press, New York, 1972, pp. 85-104.
11. M. Luby, A. Wigderson, Pairwise independence and derandomization, Technical Report TR-95-035, International Computer Science Institute, Berkeley, CA, 1995.
12. K. Mulmuley, Randomized geometric algorithms and pseudorandom generators, Algorithmica 16 (1996) 450-463.
13. S. Rajagopalan, V.V. Vazirani, Primal-dual RNC approximation algorithms for (multi)-set (multi)-cover and covering integer programs, in: Proceedings of the 34th Annual Symposium on Foundations of Computer Science, Palo Alto, CA, IEEE, 1993, pp. 322-331.
14. Journal version appears in: SIAM J. Comput. 28 (1999) 525-540.