I have a bipartite graph SKUs $\times$ customers. Two vertices are connected if a customer bought that SKU (at least $k$ times). I want to find $n$ SKUs that cover as many customers as possible.
Does this problem have a formal name? Do you know any software for solving it?