We have $n$ sets of $k$ points in $\mathbb R^d$ and we are trying to partition them to $k$ clusters of $n$ points such that from each set every point is mapped to a different cluster and the sum of variances of each cluster is minimized, i.e., we are trying to solve the $k$-means problem but with the constraint that points from the same set can't go to the same cluster.
I know that even for $n=3,d=2$ this problem is NP-hard in $k$ but I'm trying to figure out if for constant $k$ this problem is NP-hard in $n$?
I've looked in the Wikipedia page of NP-hard problems and tried to think if I can do a reduction to one of them but i couldn't think of any way to do so.