Minimum Entropy Combinatorial Optimization Problems
arXiv:1008.2928 · doi:10.1007/s00224-011-9371-2
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.