Approximation algorithms on k-correlation clustering
From MaRDI portal
(Redirected from Approximation algorithms on k-correlation clustering)
Approximation algorithms on \(k\)-correlation clustering
Approximation algorithms on \(k\)-correlation clustering
Recommendations
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
(4)- Approximation Algorithms for the Capacitated Min–Max Correlation Clustering Problem
- Approximation algorithm for the correlation clustering problem with non-uniform hard constrained cluster sizes
- Approximation algorithm for min-max correlation clustering problem with penalties
- Improved approximation algorithm for min-max correlation clustering problem with penalties
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)
