Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2404.06797 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908446863917056 |
|---|---|
| author | Behnezhad, Soheil Charikar, Moses Cohen-Addad, Vincent Ghafari, Alma Ma, Weiyun |
| author_facet | Behnezhad, Soheil Charikar, Moses Cohen-Addad, Vincent Ghafari, Alma Ma, Weiyun |
| contents | We study the classic correlation clustering in the dynamic setting. Given $n$ objects and a complete labeling of the object-pairs as either similar or dissimilar, the goal is to partition the objects into arbitrarily many clusters while minimizing disagreements with the labels. In the dynamic setting, an update consists of a flip of a label of an edge. In a breakthrough result, [BDHSS, FOCS'19] showed how to maintain a 3-approximation with polylogarithmic update time by providing a dynamic implementation of the Pivot algorithm of [ACN, STOC'05]. Since then, it has been a major open problem to determine whether the 3-approximation barrier can be broken in the fully dynamic setting. In this paper, we resolve this problem. Our algorithm, Modified Pivot, locally improves the output of Pivot by moving some vertices to other existing clusters or new singleton clusters. We present an analysis showing that this modification does indeed improve the approximation to below 3. We also show that its output can be maintained in polylogarithmic time per update. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2404_06797 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Correlation Clustering Beyond the Pivot Algorithm Behnezhad, Soheil Charikar, Moses Cohen-Addad, Vincent Ghafari, Alma Ma, Weiyun Data Structures and Algorithms We study the classic correlation clustering in the dynamic setting. Given $n$ objects and a complete labeling of the object-pairs as either similar or dissimilar, the goal is to partition the objects into arbitrarily many clusters while minimizing disagreements with the labels. In the dynamic setting, an update consists of a flip of a label of an edge. In a breakthrough result, [BDHSS, FOCS'19] showed how to maintain a 3-approximation with polylogarithmic update time by providing a dynamic implementation of the Pivot algorithm of [ACN, STOC'05]. Since then, it has been a major open problem to determine whether the 3-approximation barrier can be broken in the fully dynamic setting. In this paper, we resolve this problem. Our algorithm, Modified Pivot, locally improves the output of Pivot by moving some vertices to other existing clusters or new singleton clusters. We present an analysis showing that this modification does indeed improve the approximation to below 3. We also show that its output can be maintained in polylogarithmic time per update. |
| title | Correlation Clustering Beyond the Pivot Algorithm |
| topic | Data Structures and Algorithms |
| url | https://arxiv.org/abs/2404.06797 |