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. © 2011 Springer Science+Business Media, LLC.
Author supplied keywords
Cite
CITATION STYLE
APA
Cardinal, J., Fiorini, S., & Joret, G. (2012). Minimum Entropy Combinatorial Optimization Problems. Theory of Computing Systems, 51(1), 4–21. https://doi.org/10.1007/s00224-011-9371-2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free