Algorithm to discover the minimal set of configurations to satisfy a set of constraints. Derives an optimal solution by reducing the problem to the graph coloring problem on a mutex graph.
Solution by Tillmann Rendel. Original implementation by Christian Kaestner