Parameterized Complexity of Connected Network Microaggregation: The Role of Cluster Size
This work studies the parameterized complexity of the unweighted Connected Network Microaggregation problem, focusing on structural parameters and natural clustering parameters such as the distance bound and cluster size gap, and proves that the problem is NP-hard on graphs of bounded clique-width.