On cluster editing problem with clusters of small sizes

DOI10.1007/978-3-031-47859-8_23MaRDI QIDQ6588757

Alexander Kononov, Victor Petrovich Il'ev

Publication date: 16 August 2024

zbMATH Keywords

approximation algorithmcluster editingperformance guarantee

Mathematics Subject Classification ID

Computer science (68-XX) Calculus of variations and optimal control; optimization (49-XX) Systems theory; control (93-XX) Operations research, mathematical programming (90-XX) Game theory, economics, finance, and other social and behavioral sciences (91-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph clustering
• Correlation clustering
• NP-hard problems in hierarchical-tree clustering
• La reduction minimale d'un graphe à une reunion de cliques
• Cluster graph modification problems
• A literature review on correlation clustering: cross-disciplinary taxonomy with bibliometric analysis
• A 2-approximation algorithm for the graph 2-clustering problem
• Correlation clustering in general weighted graphs
• Clustering with qualitative information
• Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs
• Correlation Clustering with Constrained Cluster Sizes and Extended Weights Bounds
• Graph clustering with a constraint on cluster sizes
• 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
• A Local-Search 2-Approximation for 2-Correlation-Clustering
• Approximating Symmetric Relations by Equivalence Relations
• Aggregating inconsistent information
• Approximation algorithms and hardness results for the clique packing problem

This page was built for publication: On cluster editing problem with clusters of small sizes