Improved approximation algorithms for low-density instances of the Minimum Entropy Set Cover Problem

Authors:
Cosmin Bonchiş;Gabriel Istrate
Affiliations:
Department of Computer Science, West University of Timişoara, Bd. V. Pírvan 4, Timişoara, RO-300223, Romania and e-Austria Research Institute, Bd. V. Pírvan 4, cam. 045 B, Timi ...;e-Austria Research Institute, Bd. V. Pírvan 4, cam. 045 B, Timişoara, RO-300223, Romania
Venue:
Information Processing Letters
Year:
2014

Citing 5
Cited 0

The minimum-entropy set cover problem

Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Tight Results on Minimum Entropy Set Cover

Algorithmica
Heuristic algorithms in computational molecular biology

Journal of Computer and System Sciences
Minimum Entropy Combinatorial Optimization Problems

Theory of Computing Systems - Computability in Europe: Mathematical Theory and Computational Practice
Minimum entropy orientations

Operations Research Letters

Quantified Score

Hi-index	0.89

Visualization

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.