Metraipolis › archive › dc_abf038f3dabc

Parameterized Complexity of Connected Network Microaggregation: The Role of Cluster Size — arXiv:2608.28920

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.28920
License (as archived)
CC0-1.0
Archived
2026-10-17T10:07:10.008Z
SHA-256 of the archived text
3c3dc9c4dae88af24da9eeb568e0e3aa3bc0454c85db1a98982fbbd6fada4d82
Stable URL of this page
https://metraipolis.com/documento/dc_abf038f3dabc

How to cite

Parameterized Complexity of Connected Network Microaggregation: The Role of Cluster Size — arXiv:2608.28920 — arXiv (en), https://arxiv.org/abs/2608.28920 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_abf038f3dabc (Metraipolis archive dc_abf038f3dabc, sha256 3c3dc9c4dae88af24da9eeb568e0e3aa3bc0454c85db1a98982fbbd6fada4d82)
BibTeX
@misc{dcabf038f3dabc,
  title = {Parameterized Complexity of Connected Network Microaggregation: The Role of Cluster Size — arXiv:2608.28920},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.28920},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_abf038f3dabc; sha256 3c3dc9c4dae88af24da9eeb568e0e3aa3bc0454c85db1a98982fbbd6fada4d82},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.28920. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Network microaggregation is a fundamental technique in statistical disclosure control, where vertices of a graph are partitioned into clusters satisfying size constraints and admitting a center within bounded distance. We study the parameterized complexity of the \emph{unweighted Connected Network Microaggregation} problem, focusing on structural parameters and natural clustering parameters such as the distance bound $d$ and cluster size gap $u-\ell$. We show that, unlike the weighted variant, the unweighted connected problem is fixed-parameter tractable when parameterized by neighborhood diversity, and hence by vertex cover. In contrast, it remains $\mathrm{W[1]}$-hard for more general structural parameters, including vertex deletion to paths, stars, and cliques. These hardness results hold even for every $d\ge 2$ and any fixed gap $u-\ell$, showing that these clustering parameters do not overcome the structural hardness. We further show that adding the cluster size bound $u$ restores tractability for structural parameters such as treewidth and cluster vertex deletion. Moreover, $u$ is essential: the problem remains $\mathrm{W[1]}$-hard when these structural parameters are considered alone. For kernelization, we prove that the problem has no polynomial kernel parameterized by vertex cover unless $\mathrm{coNP}\subseteq\mathrm{NP/poly}$, even when the distance constraint is vacuous. Adding $u$ yields a polynomial kernel for vertex cover, while kernelization remains unlikely for more general structural parameters even when combined with $u$. Finally, we show that the problem is NP-hard on graphs of bounded clique-width.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-01 in cs.DS).
Categorie arXiv: Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2608.28920 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-17T10:00:01.281Z dalla pagina https://arxiv.org/catchup/cs.DS/2026-09-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).