Metraipolis › archive › dc_efb88913503d

Optimal Approximation for Constrained Correlation Clustering via Repulsion — arXiv:2611.04784

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.04784
License (as archived)
CC0-1.0
Archived
2026-11-04T19:07:37.130Z
SHA-256 of the archived text
c1e7b9609ad509f9a58d792f39655d4919156cc66c46014662381fe4b5255d05
Stable URL of this page
https://metraipolis.com/documento/dc_efb88913503d

How to cite

Optimal Approximation for Constrained Correlation Clustering via Repulsion — arXiv:2611.04784 — arXiv (en), https://arxiv.org/abs/2611.04784 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_efb88913503d (Metraipolis archive dc_efb88913503d, sha256 c1e7b9609ad509f9a58d792f39655d4919156cc66c46014662381fe4b5255d05)
BibTeX
@misc{dcefb88913503d,
  title = {Optimal Approximation for Constrained Correlation Clustering via Repulsion — arXiv:2611.04784},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.04784},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_efb88913503d; sha256 c1e7b9609ad509f9a58d792f39655d4919156cc66c46014662381fe4b5255d05},
  year = {2026}
}

Archived text

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

The best-known approximation factor for constrained correlation clustering stood at three for nearly two decades, until a recent improvement to below $16/7$. We give a randomized polynomial-time $(2+\varepsilon)$-approximation using \emph{Repulsion}, a recursive operation that separates a metric ball from its complement. Repulsion naturally respects hard constraints and admits a short potential-based analysis; as a warm-up, radius-$2/3$ Repulsion rounds the standard metric LP into a feasible partition of cost at most three times its objective. The $(2+\varepsilon)$-approximation takes a two-stage approach, first removing must-links with arbitrarily small loss in the approximation ratio. The second stage combines lossless, constraint-aware preclustering with the bounded sub-cluster LP framework of Cao, Cohen-Addad, Lee, Li, Newman, and Vogl (STOC 2024). Repeated positive conditioning and sampling produce candidate sets, which radius-one Repulsion partitions into feasible clusters at controlled cost. We also give an approximation-preserving reduction from vertex cover to cluster deletion, a special case with only cannot-links. Apart from establishing a matching factor-two hardness threshold under the Unique Games Conjecture, it motivates our two-stage approach and Repulsion.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv cs.DS, nuovi lavori del giorno).
Categorie arXiv: Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2611.04784 — 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-11-04T18:40:52.462Z dalla pagina https://arxiv.org/list/cs.DS/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).