Given $n$ items and $m$ customers, each of whom is interested in some subset of the items, partition the set of items among $k$ different stores so that the maximum number of customers visiting any store is minimized.Does anyone recognize this problem? I have the slight feeling that it is some standard set or cut problem in disguise, but I just cannot find the right one.
partition to min the max number of intersections
max cut;partition problem;set theory