Correlation clustering with a fixed number of clusters

DOI10.4086/TOC.2006.V002A013MaRDI QIDQ3002775zbMATH OpenOpenAlexFDO

Authors Ioannis Giotis, Venkatesan Guruswami

Publication date 24 May 2011

Published in Theory of Computing (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NoDerivs 4.0 International

Full work available at URL https://doi.org/10.4086/toc.2006.v002a013

zbMATH Keywords

approximation algorithmclusteringpolynomial time approximation schemerandom sampling

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25)

Recommendations

• Correlation clustering
• Correlation clustering, maximizing agreements via semidefinite programming
• Correlation clustering with partial information
• Clustering with qualitative information
• Algorithms - ESA 2003

Cited in

(40)

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

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)