Expertini Research Research
Computer Science PDF Available DOI: 10.1007/s00224-011-9371-2 Non-peer-reviewed Preprint

Minimum Entropy Combinatorial Optimization Problems

Jean Cardinal, Samuel Fiorini, Gwenael Joret  ·  Published 2010-08-17

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.
📄 Full Paper Available as PDF
This paper is available as a downloadable PDF.
📄 Download PDF

✨ AI Plain-English Summary

Get a plain-English summary of this paper generated by AI (5 free per day).

Comments (0)

No comments yet. Be the first to comment.