Graph clustering with a constraint on cluster sizes

DOI10.1134/S1990478916030042zbMath1374.68242OpenAlexW2507375894MaRDI QIDQ2959182

A. A. Navrotskaya, Svetlana Il'eva, Victor Petrovich Il'ev

Publication date: 9 February 2017

Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1990478916030042

zbMATH Keywords

approximation algorithmgraph clusteringperformance guarantee

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• Clustering with qualitative information
• Computational complexity of the graph approximation problem
• A Local-Search 2-Approximation for 2-Correlation-Clustering
• Approximating Symmetric Relations by Equivalence Relations
• Aggregating inconsistent information

This page was built for publication: Graph clustering with a constraint on cluster sizes