The first part is dedicated to the optimization problems of packing and covering of subsets. Due to the NP-hardness of the studied problem, approximation algorithms have been extensively developed. We focus on theoretical approaches. Randomized approximation algorithms and their associated performance ratio analysis will be introduced. Implications to a sensor network problem follow. In this talk, we will also share and exchange experience and ideas in research endeavors.