Date of Award
Master of Science (MS)
Dr. Bin Fu
Dr. Zhixiang Chen
Dr. Robert Schweller
We Develop an interactive algorithm for the set cover problem. The algorithm uses multiple stages and select some sets each stage via random samples among the uncovered points. We show that it has a O(log n)—approximation ratio and takes O(log n) rounds and O(m2+ϵ ) samples each round, where n is the size of universal set and m is the number of sets.
We also prove a Ω(√logn/loglogn) lower bound for both the number of phases if each phase has poly(m) the number of samples.
Subedi, Ujjwol, "Randomized Approach tor Set Cover with Multiple Phases*" (2017). Theses and Dissertations - UTRGV. 368.