Metraipolis › archive › dc_64b565b03beb
Competitive Random-Order Correlation k-Clustering — arXiv:2609.35555
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.35555
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T00:19:03.939Z
- SHA-256 of the archived text
d2018628de6d180f7741c98ad24111bfc5a62078e9adcef5db2906cb9472e52a- Stable URL of this page
https://metraipolis.com/documento/dc_64b565b03beb
How to cite
Competitive Random-Order Correlation k-Clustering — arXiv:2609.35555 — arXiv (en), https://arxiv.org/abs/2609.35555 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_64b565b03beb (Metraipolis archive dc_64b565b03beb, sha256 d2018628de6d180f7741c98ad24111bfc5a62078e9adcef5db2906cb9472e52a)
BibTeX
@misc{dc64b565b03beb,
title = {Competitive Random-Order Correlation k-Clustering — arXiv:2609.35555},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.35555},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_64b565b03beb; sha256 d2018628de6d180f7741c98ad24111bfc5a62078e9adcef5db2906cb9472e52a},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.35555. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Correlation clustering has been extensively studied over the last two decades in many different computational models owing to its wide-ranging practical applications. The goal is to compute a partition of the vertex set such that the total number of disagreements, i.e. the sum of edges between clusters, and non-edges within clusters, is minimized. In this paper, we study correlation $k$-clustering, in which the total number of clusters is restricted to $k$. Correlation $k$-clustering is NP-hard, and while previous work has presented a polynomial time approximation scheme for constant $k$, there are no known results for general $k$. Our first result is a polynomial-time constant-factor approximation algorithm for correlation $k$-clustering for general $k$. The main focus of this work is in the more challenging online setting. Noting that the best competitive ratio under adversarial arrivals is known to be $\Omega(n)$, we concentrate on the well-studied random-order model, where vertices arrive in random order and on arrival of a vertex, edges to its earlier-arrived neighbors are revealed. We prove a surprising lower bound of $\Omega(\log k)$-competitiveness for any online algorithm, which can be extended to $\Omega(\log n)$ when $k = \text{poly}(n)$. Finally, the main result of this paper is a polylogarithmic upper bound on the competitive ratio for correlation $k$-clustering, using an algorithm inspired by the classic Pivot algorithm for correlation clustering.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-29 in cs.DS).
Categorie arXiv: Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2609.35555 — 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-07T23:56:21.784Z dalla pagina https://arxiv.org/catchup/cs.DS/2026-09-29?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).