Correlation clustering, maximizing agreements via semidefinite programming
From MaRDI portal
Recommendations
Cited in
(45)- Evaluating balancing on social networks through the efficient solution of correlation clustering problems
- Clustering data that are graph connected
- Correlation clustering in data streams
- Approximation algorithm for the balanced 2-correlation clustering problem on well-proportional graphs
- A literature review on correlation clustering: cross-disciplinary taxonomy with bibliometric analysis
- Discriminative clustering with representation learning with any ratio of labeled to unlabeled data
- Approximation algorithms for two variants of correlation clustering problem
- Algorithms and complexity results for labeled correlation clustering problem
- Cheeger constants, structural balance, and spectral clustering analysis for signed graphs
- Min-max correlation clustering via multicut
- Local guarantees in graph cuts and clustering
- Correlation clustering in general weighted graphs
- Clustering with qualitative information
- Approximation algorithms for the lower bounded correlation clustering problem
- Design and analysis of bipartite experiments under a linear exposure-response model
- A polyhedral study of lifted multicuts
- Correlation clustering with constrained cluster sizes and extended weights bounds
- Correlation clustering with a fixed number of clusters
- A randomized PTAS for the minimum consensus clustering with a fixed number of clusters
- A semidefinite programming rounding algorithm for correlation clustering problem
- Finding the closest ultrametric
- Improved approximation algorithms for bipartite correlation clustering
- Metric-Constrained Optimization for Graph Clustering Algorithms
- Adapting local sequential algorithms to the distributed setting
- Correlation clustering generalized
- On a semi-supervised graph clustering problem
- scientific article; zbMATH DE number 7650100 (Why is no real title available?)
- Algorithms - ESA 2003
- Correlation clustering with partial information
- LP-based pivoting algorithm for higher-order correlation clustering
- LP-based pivoting algorithm for higher-order correlation clustering
- Correlation clustering and two-edge-connected augmentation for planar graphs
- Approximation Algorithms for the Capacitated Min–Max Correlation Clustering Problem
- Approximation algorithms on \(k\)-correlation clustering
- A combinatorial multi-armed bandit approach to correlation clustering
- Approximating sparse quadratic programs
- Approach to analysis and construction of algorithms for solving one clustering problem on signed graphs
- Approximation algorithm for min-max correlation clustering problem with penalties
- An FPT constant-factor approximation algorithm for correlation clustering
- A (3+)-approximate correlation clustering algorithm in dynamic streams
- Fault tolerant max-cut
- Narrowing the \textsf{LOCAL-CONGEST} gaps in sparse networks via expander decompositions
- Triangles improve 0.878 approximation for Maxcut
- On the approximation of correlation clustering and consensus clustering
- A note on the inapproximability of correlation clustering
This page was built for publication: Correlation clustering, maximizing agreements via semidefinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501301)
