Yannick Frein

Learn More
We consider the problem of minimizing the size of a family of sets G such that every subset of {1,. .. , n} can be written as a disjoint union of at most k members of G, where k and n are given numbers. This problem originates in a real-world application aiming at the diversity of industrial production. At the same time, the question of finding the minimum(More)