Correlation clustering with partial information

DOI10.1007/B11961MaRDI QIDQ5900917zbMATH OpenOpenAlexFDO

Authors Erik D. Demaine, Nicole Immorlica

Publication date 26 May 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b11961

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Correlation clustering in general weighted graphs
• Correlation clustering
• Algorithms - ESA 2003
• Correlation clustering, maximizing agreements via semidefinite programming
• Correlation clustering with a fixed number of clusters

Cited in

(33)

• Semi-supervised graph clustering: a kernel approach
• A literature review on correlation clustering: cross-disciplinary taxonomy with bibliometric analysis
• Clustering with partial information
• Min-max correlation clustering via multicut
• Online clique clustering
• Correlation clustering in general weighted graphs
• Clustering with qualitative information
• Correlation clustering with constrained cluster sizes and extended weights bounds
• Correlation clustering and two-edge-connected augmentation for planar graphs
• Correlation clustering with a fixed number of clusters
• Correlation clustering
• A Local-Search 2-Approximation for 2-Correlation-Clustering
• Clustering with Partial Information
• Correlation Clustering Revisited: The “True” Cost of Error Minimization Problems
• A randomized PTAS for the minimum consensus clustering with a fixed number of clusters
• Finding the closest ultrametric
• Metric-Constrained Optimization for Graph Clustering Algorithms
• Correlation clustering generalized
• Simple iterative heuristics for correlation clustering
• Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability
• scientific article; zbMATH DE number 7307464 (Why is no real title available?)
• Correlation clustering with noisy input
• Resource-Bounded Information Gathering for Correlation Clustering
• LP-based pivoting algorithm for higher-order correlation clustering
• LP-based pivoting algorithm for higher-order correlation clustering
• Sublinear time and space algorithms for correlation clustering via sparse-dense decompositions
• Approximation algorithms on \(k\)-correlation clustering
• A combinatorial multi-armed bandit approach to correlation clustering
• Approach to analysis and construction of algorithms for solving one clustering problem on signed graphs
• Simultaneously approximating all _p-norms in correlation clustering
• The multi-multiway cut problem
• 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 with partial information

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5900917)