Approximation algorithms on k-correlation clustering

DOI10.1007/S40305-022-00418-4OpenAlexW4225163019MaRDI QIDQ6151012FDOQ6151012

Authors: Zhongzheng Tang, Zhuo Diao Edit this on Wikidata

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

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

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)

Cites Work

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

Cited In (1)

• Approximation Algorithms for the Capacitated Min–Max Correlation Clustering Problem

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)