A Derandomization Using Min-Wise Independent Permutations
Min-wise independence is a recently introduced notion of limited independence, similar in spirit to pairwise independence. The later has proven essential for the derandomization of many algorithms. Here we show that approximate min-wise independence allows similar uses, by presenting a derandomization of the RNC algorithm for approximate set cover due to S. Rajagopalan and V. Vazirani. We also discuss how to derandomize their set multi-cover and multi-set multi-cover algorithms in restricted cases. The multi-cover case leads us to discuss the concept of k-minima-wise independence, a natural counterpart to k-wise independence.
Unable to display preview. Download preview PDF.
- 2.A. Z. Broder. On the resemblance and containment of documents. In Proceedings of Compression and Complexity of Sequences 1997, pages 21–29. IEEE Computer Society, 1988.Google Scholar
- 3.A. Z. Broder. Filtering near-duplicate documents. In Proceedings of FUN 98, 1998. To appear.Google Scholar
- 4.A. Z. Broder, M. Charikar, A. Frieze, and M. Mitzenmacher. Min-wise independent permutations. In Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, pages 327–336, 1998.Google Scholar
- 5.A. Z. Broder, S. C. Glassman, M. S. Manasse, and G. Zweig. Syntactic clustering of the Web. In Proceedings of the Sixth International World Wide Web Conference, pages 391–404, 1997.Google Scholar
- 6.J. L. Carter and M. N. Wegman. Universal classes of hash functions. Journal of Computer and System Sciences, 18(2):143–154, Apr. 1979.Google Scholar
- 7.U. Feige. A threshold of ln n for approximating set cover (preliminary version). In Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, pages 314–318, Philadelphia, Pennsylvania, 22–24 May 1996.Google Scholar
- 9.P. Indyk, A small approximately min-wise independent family of hash functions. manuscript, 1998.Google Scholar
- 10.R. M. Karp. Reducibility among combinatorial problems. In R. E. Miller and J. W. Thatcher, editors, Complexity of Computer Computations, pages 85–104. Plenum Press, New York, 1972.Google Scholar
- 11.M. Luby and A. Wigderson. Pairwise independence and derandomization. Technical Report TR-95-035, International Computer Science Institute, Berkeley, California, 1995.Google Scholar
- 12.S. Rajagopalan and V. V. Vazirani. Primal-dual RNC approximation algorithms for (multi)-set (multi)-cover and covering integer programs. In 34th Annual Symposium on Foundations of Computer Science, pages 322–331, Palo Alto, California, 3-5 Nov. 1993. IEEE. Journal version to appear in SIAM Journal of Computing.Google Scholar