Minimum Entropy Combinatorial Optimization Problems
classification
💻 cs.DS
cs.DM
keywords
entropyminimumproblemscombinatorialoptimizationcoloringcoverdiscrete
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.