Cardinality Constrained Graph Partitioning into Cliques with Submodular Costs
José Correa, Nicole Megow, Rajiv Raman, Karol Suchan · 2009
We consider the problem of partitioning a graph into cliques of bounded cardinality. The goal is to find a partition that minimizes the sum of clique costs where the cost of a clique is given by a set function on the nodes. We present a general algorithmic solution based on solving the problem variant without the