A Derandomization Using Min-Wise Independent Permutations

abstract for submission to Random '98 not for distribution Andrei Z. Broder Moses Charikar Michael Mitzenmacher 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.

• Type: Conference
• Year: 1998
• Where: RANDOM
• Authors: Andrei Z. Broder, Moses Charikar, Michael Mitzenmacher
• Keywords: Approximate Min-wise Independence, Min-wise Independence, Mitzenmacher Min-wise Independence, RANDOM 1998, Theoretical Computer Science