C. Bonchis and G. Istrate. Improved approximation algorithms for lowdensity instances of the Minimum Entropy Set Cover Problem. Information Processing Letters, 114(7), p. 360–365, 2014.
Abstract:
We study the approximability of instances of the minimum entropy set cover problem, parameterized by the average frequency of a random element in the covering sets. We analyze an algorithm combining a greedy approach with another one biased towards large sets. The algorithm is controlled by the percentage of elements to which we apply the biased approach. The optimal parameter choice leads to improved approximation guarantees when average element frequency is less than e.
Keywords:
Entropy, Set cover, Approximation algorithms
URL:
http://www.sciencedirect.com/science/article/pii/S0020019014000246
Posted by
Gabriel Istrate
Back
