Approximation algorithms on k-correlation clustering

DOI10.1007/S40305-022-00418-4MaRDI QIDQ6151012zbMATH OpenOpenAlexFDO

Authors Zhongzheng Tang, Zhuo Diao

Publication date 9 February 2024

Published in Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s40305-022-00418-4

zbMATH Keywords

approximation algorithms\(k\)-correlation clusterschoosing the better of two solutions

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Recommendations

• Correlation clustering, maximizing agreements via semidefinite programming
• Correlation clustering in general weighted graphs
• A note on the inapproximability of correlation clustering
• Correlation clustering
• Algorithms - ESA 2003

Cites work

• A new way of using semidefinite programming with applications to linear equations mod \(p\)
• Algorithms - ESA 2003
• Clustering with qualitative information
• Correlation clustering
• Correlation clustering in general weighted graphs
• Correlation clustering with a fixed number of clusters
• Correlation clustering with partial information
• Correlation clustering, maximizing agreements via semidefinite programming
• Evaluating balancing on social networks through the efficient solution of correlation clustering problems
• How easy is local search?
• On conditions for a meeting not to reach a deadlock
• Partitioning Signed Two-Mode Networks
• Structural Balance: A Dynamic Perspective

Cited in

(2)

• Approximation Algorithms for the Capacitated Min–Max Correlation Clustering Problem
• Approximation algorithm for the correlation clustering problem with non-uniform hard constrained cluster sizes

This page was built for publication: Approximation algorithms on \(k\)-correlation clustering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6151012)