AAAI 2023 📺 G2OAT | tags:[ parameterized complexity graph theory ]

# The Parameterized Complexity of Network Microaggregation

with Robert Ganian, Dušan Knop, Jan Pokorný, Šimon Schierreich, and Kirill Simonov## Abstract

Microaggregation is a classical statistical disclosure control technique which requires the input data to be partitioned into clusters while adhering to specified size constraints. We provide novel exact algorithms and lower bounds for the task of microaggregating a given network while considering both unrestricted and connected clusterings, and analyze these from the perspective of the parameterized complexity paradigm. Altogether, our results assemble a complete complexity-theoretic picture for the network microaggregation problem with respect to the most natural parameterizations of the problem, including input-specified parameters capturing the size and homogeneity of the clusters as well as the treewidth and vertex cover number of the network.