Metraipolis › archive › dc_1850091afdfe
CKR Partitions and Lower Bounds for Constrained Correlation Clustering and Variants — arXiv:2608.08291
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.08291
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-19T09:16:38.692Z
- SHA-256 of the archived text
f21fcdc935af2a4d5d3c93414a34aebe36f61429500323808a3293c985c29f19- Stable URL of this page
https://metraipolis.com/documento/dc_1850091afdfe
How to cite
CKR Partitions and Lower Bounds for Constrained Correlation Clustering and Variants — arXiv:2608.08291 — arXiv (en), https://arxiv.org/abs/2608.08291 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_1850091afdfe (Metraipolis archive dc_1850091afdfe, sha256 f21fcdc935af2a4d5d3c93414a34aebe36f61429500323808a3293c985c29f19)
BibTeX
@misc{dc1850091afdfe,
title = {CKR Partitions and Lower Bounds for Constrained Correlation Clustering and Variants — arXiv:2608.08291},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.08291},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_1850091afdfe; sha256 f21fcdc935af2a4d5d3c93414a34aebe36f61429500323808a3293c985c29f19},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.08291. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
By using a simple textbook reduction from vertex cover, we show that the following three problems are all UG-hard to approximate with constant-factor smaller than two; minimum weakness strong triadic closure, cluster deletion and constrained correlation clustering. Additionally, we analyze the well-known low-diameter decomposition by Calinescu, Karloff and Raban applied to the standard LP relaxation semi-metric for constrained correlation clustering. As opposed to traditional pivot-based approaches, a CKR partition elegantly handles must-link and cannot-link constraints. It guarantees a 3-approximation in expectation, which matches the original approximation ratio by van Zuylen and Williamson. We conjecture that it in fact achieves a strictly better than 3-approximation, yet this remains an open problem. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-11 in cs.DS). Categorie arXiv: Data Structures and Algorithms (cs.DS). Pagina del lavoro: https://arxiv.org/abs/2608.08291 — 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-19T09:13:57.837Z dalla pagina https://arxiv.org/catchup/cs.DS/2026-08-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).