Minimum Entropy Combinatorial Optimization Problems

TL;DR

This paper surveys recent research on combinatorial optimization problems where the goal is to minimize the entropy of a discrete distribution, covering various problems like set cover, orientation, and coloring.

Contribution

It provides a comprehensive overview of recent advances in entropy-based combinatorial optimization problems, highlighting key results and open questions.

Findings

Summarizes recent theoretical results on entropy minimization in combinatorial problems.

Identifies key challenges and open problems in the field.

Connects entropy optimization to classical combinatorial problems.

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.