Correlation clustering with a fixed number of clusters
From MaRDI portal
Recommendations
Cited in
(38)- Correlation Clustering
- scientific article; zbMATH DE number 7561398 (Why is no real title available?)
- Correlation clustering
- Characterization of 2-path signed network
- A near-optimal adaptive algorithm for maximizing modularity in dynamic scale-free networks
- A Local-Search 2-Approximation for 2-Correlation-Clustering
- A randomized PTAS for the minimum consensus clustering with a fixed number of clusters
- Correlation Clustering Revisited: The “True” Cost of Error Minimization Problems
- Graph clustering with a constraint on cluster sizes
- Fixed-parameter algorithms for cluster vertex deletion
- Parameterized algorithms for min-max 2-cluster editing
- Approximate algorithms for graph clustering problem
- Approximation algorithms on \(k\)-correlation clustering
- Correlation clustering
- Correlation clustering with noisy input
- On the approximation of correlation clustering and consensus clustering
- On cluster editing problem with clusters of small sizes
- On a correlational clustering of integers
- Algorithms and Computation
- The branch and cut method for the clique partitioning problem
- Correlation clustering in data streams
- Exploiting dense structures in parameterized complexity
- Correlation clustering with partial information
- Fixed-Parameter Algorithms for Cluster Vertex Deletion
- Correlation clustering, maximizing agreements via semidefinite programming
- MOLECULAR DYNAMICS APPROACH TO CORRELATION CLUSTERING
- Clustering with qualitative information
- A note on the inapproximability of correlation clustering
- Simple iterative heuristics for correlation clustering
- 2-approximation algorithms for two graph clustering problems
- Parameterized algorithms for the 2-clustering problem with minimum sum and minimum sum of squares objective functions
- scientific article; zbMATH DE number 7758351 (Why is no real title available?)
- On a semi-supervised graph clustering problem
- Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability
- Editing graphs into few cliques: complexity, approximation, and kernelization schemes
- The complexity of the simultaneous cluster problem
- Dynamics in network interaction games
- Adapting local sequential algorithms to the distributed setting
This page was built for publication: Correlation clustering with a fixed number of clusters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3002775)
