Bentert, M. and Crane, A. and Drange, P.G. and Reidl, Felix and Sullivan, B.D. (2024) Correlation clustering with vertex splitting. Leibniz International Proceedings in Informatics (LIPIcs) 294 , 8:1-8:17. ISSN 1868-8969.
|
Text
splitting.pdf - Published Version of Record Available under License Creative Commons Attribution. Download (667kB) | Preview |
Abstract
We explore CLUSTER EDITING and its generalization CORRELATION CLUSTERING with a new operation called permissive vertex splitting which addresses finding overlapping clusters in the face of uncertain information. We determine that both problems are NP-hard, yet they exhibit significant differences in terms of parameterized complexity and approximability. For CLUSTER EDITING WITH PERMISSIVE VERTEX SPLITTING, we show a polynomial kernel when parameterized by the solution size and develop a polynomial-time 7-approximation. In the case of CORRELATION CLUSTERING, we establish para-NP-hardness when parameterized by the solution size and demonstrate that computing an n^{1-ε}-approximation is NP-hard for any constant ε > 0. Additionally, we extend an established link between CORRELATION CLUSTERING and MULTICUT to the setting with permissive vertex splits.
Metadata
| Item Type: | Article |
|---|---|
| Additional Information: | 9th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024) |
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Felix Reidl |
| Date Deposited: | 14 Jun 2024 05:20 |
| Last Modified: | 14 Jun 2024 15:37 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/53689 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
