<p>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.</p>

<p>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.</p>

<max-cut><partition-problem><set-theory>
partition to min the max number of intersections
user16035
# partition to min the max number of intersections

(Asked by: username_0 on 2013-05-14)

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.

**Tags:** max-cut, partition-problem, set-theory

---

## 0 answers

