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

11/05/2018

∙

by   Alexander Prolubnikov, et al.

∙

0

∙

share

For the set cover problem, by modifying the approach that leads to the proof of the logarithmic approximation guarantee for the greedy algorithm, we obtain an estimation of the greedy algorithm's accuracy for a given input. By modifying the approach that leads to the proof of the logarithmic approximation guarantee for the set cover problem, we obtain an estimation of the greedy algorithm's accuracy for a given input. We show that, for a wide share of the problem instances, the accuracy of the greedy algorithm may be estimated much better than the common logarithmic approximation guarantee suggests.