Minimum Entropy Combinatorial Optimization Problems
Data Structures and Algorithms
2013-05-24 v1 Discrete Mathematics
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.
Keywords
Cite
@article{arxiv.1008.2928,
title = {Minimum Entropy Combinatorial Optimization Problems},
author = {Jean Cardinal and Samuel Fiorini and Gwenaël Joret},
journal= {arXiv preprint arXiv:1008.2928},
year = {2013}
}