An estimation of the greedy algorithm's accuracy for a set cover problem instance

Alexander Prolubnikov

Considering the set cover problem, by modifying the approach that gives a logarithmic approximation guarantee for the greedy algorithm, we obtain an estimation of the greedy algori…