On cluster editing problem with clusters of small sizes
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3797792 (Why is no real title available?)
- A 2-approximation algorithm for the graph 2-clustering problem
- A Local-Search 2-Approximation for 2-Correlation-Clustering
- A literature review on correlation clustering: cross-disciplinary taxonomy with bibliometric analysis
- Aggregating inconsistent information: ranking and clustering
- Approximating Symmetric Relations by Equivalence Relations
- Approximation algorithms and hardness results for the clique packing problem
- Cluster graph modification problems
- Clustering with qualitative information
- Computational complexity of the problem of approximation by graphs with connected components of bounded size
- Correlation clustering
- Correlation clustering in general weighted graphs
- Correlation clustering with a fixed number of clusters
- Correlation clustering with constrained cluster sizes and extended weights bounds
- Graph clustering
- Graph clustering with a constraint on cluster sizes
- La reduction minimale d'un graphe à une reunion de cliques
- NP-hard problems in hierarchical-tree clustering
- Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs
- On the Size of Systems of Sets Every t of which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems
Cited in
(2)
This page was built for publication: On cluster editing problem with clusters of small sizes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6588757)
