APPROXIMATE ALGORITHMS FOR GRAPH CLUSTERING PROBLEM

DOI10.17223/20710410/45/7zbMath1458.68281OpenAlexW2987925530MaRDI QIDQ5151277

Alexander Morshinin, Svetlana Il'eva, Victor Petrovich Il'ev

Publication date: 17 February 2021

Published in: Prikladnaya Diskretnaya Matematika (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/pdm672

zbMATH Keywords

approximation algorithmgraph clusteringperformance guarantee

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Cites Work

• Graph clustering
• Correlation clustering
• Semi-supervised graph clustering: a kernel approach
• NP-hard problems in hierarchical-tree clustering
• Cluster graph modification problems
• Clustering with qualitative information
• Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs
• Computational complexity of the graph approximation problem
• Short Survey on Graph Correlation Clustering with Minimization Criteria
• A Local-Search 2-Approximation for 2-Correlation-Clustering
• Aggregating inconsistent information
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: APPROXIMATE ALGORITHMS FOR GRAPH CLUSTERING PROBLEM