Approximation algorithms on \(k\)-correlation clustering

DOI10.1007/s40305-022-00418-4OpenAlexW4225163019MaRDI QIDQ6151012

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Correlation clustering
• How easy is local search?
• On conditions for a meeting not to reach a deadlock
• Evaluating balancing on social networks through the efficient solution of correlation clustering problems
• Correlation clustering in general weighted graphs
• Clustering with qualitative information
• A New Way of Using Semidefinite Programming with Applications to Linear Equations mod p
• Partitioning Signed Two-Mode Networks
• Structural Balance: A Dynamic Perspective
• Algorithms - ESA 2003
• Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques

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