Minimum Entropy Combinatorial Optimization Problems

Authors:
Jean Cardinal;Samuel Fiorini;Gwenaël Joret
Affiliations:
Université Libre de Bruxelles, Département d’Informatique, c.p. 212, 1050, Brussels, Belgium;Université Libre de Bruxelles, Département de Mathématique, c.p. 216, 1050, Brussels, Belgium;Université Libre de Bruxelles, Département d’Informatique, c.p. 212, 1050, Brussels, Belgium
Venue:
Theory of Computing Systems - Computability in Europe: Mathematical Theory and Computational Practice
Year:
2012

Citing 0
Cited 1

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

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We survey recent results on combinatorial optimization problems in which the objective function is the entropy of a discrete distribution. These include the minimum entropy set cover, minimum entropy orientation, and minimum entropy coloring problems.