Randomized Approach tor Set Cover with Multiple Phases*

Author

Ujjwol Subedi, The University of Texas Rio Grande Valley

Date of Award

5-2017

Document Type

Thesis

Degree Name

Master of Science (MS)

Department

Computer Science

First Advisor

Dr. Bin Fu

Second Advisor

Dr. Zhixiang Chen

Third Advisor

Dr. Robert Schweller

Abstract

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.

Comments

Copyright 2017 Ujjwol Subedi. All Rights Reserved.

https://www.proquest.com/dissertations-theses/randomized-approach-tor-set-cover-with-multiple/docview/1938704891/se-2?accountid=7119

Recommended Citation

Subedi, Ujjwol, "Randomized Approach tor Set Cover with Multiple Phases*" (2017). Theses and Dissertations. 368.
https://scholarworks.utrgv.edu/etd/368