On the Partition Set Cover Problem

Tanmay Inamdar, Kasturi Varadarajan

Several algorithms with an approximation guarantee of $O(\log n)$ are known for the Set Cover problem, where $n$ is the number of elements. We study a generalization of the Set Cov…