Coloring for dispersion: A polynomial-time algorithm for cardinality-constrained 2-anticlustering

Nguyen Khoa Tran, Lin Mu, Martin Papenberg +1

The $k$-Maximum Dispersion Problem with Cardinality Constraints ($k$-MDCC) asks for a partition of a given item set with pairwise dissimilarities into $k$ cardinality-constrained g…