  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.
