A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
Zero knowledge and the chromatic number
Journal of Computer and System Sciences - Eleventh annual conference on structure and complexity 1996
Approximating Min Sum Set Cover
Algorithmica
The minimum-entropy set cover problem
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Source coding and graph entropies
IEEE Transactions on Information Theory
Independent sets in bounded-degree hypergraphs
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Hi-index | 0.00 |
In the minimum entropy set cover problem, one is given a collection of k sets which collectively cover an n-element ground set. A feasible solution of the problem is a partition of the ground set into parts such that each part is included in some of the k given sets. The goal is to find a partition minimizing the (binary) entropy of the corresponding probability distribution, i.e., the one found by dividing each part size by n. Halperin and Karp have recently proved that the greedy algorithm always returns a solution whose cost is at most the optimum plus a constant. We improve their result by showing that the greedy algorithm approximates the minimum entropy set cover problem within an additive error of 1 nat = log2e bits ≃ 1.4427 bits. Moreover, inspired by recent work by Feige, Lovász and Tetali on the minimum sum set cover problem, we prove that no polynomial-time algorithm can achieve a better constant, unless P = NP. We also discuss some consequences for the related minimum entropy coloring problem.