An analysis of the greedy algorithm for the submodular set covering problem | doi.page