Minimum Entropy Combinatorial Optimization Problems
Published in arXiv (Cornell University) • Aug 17, 2010
NobleIDNI1P62W18R22S54
Authors:,,
Jean Cardinal
Samuel Fiorini
Gwenaël Joret
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.
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!