An Approximation Algorithm for a Semi-supervised Graph Clustering Problem

DOI10.1007/978-3-030-58657-7_3zbMath1460.90149OpenAlexW3085319379MaRDI QIDQ4965096

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

Publication date: 25 February 2021

Published in: Mathematical Optimization Theory and Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-58657-7_3

zbMATH Keywords

approximation algorithmgraph clusteringperformance guarantee

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• Correlation clustering
• Cluster graph modification problems
• A 2-approximation algorithm for the graph 2-clustering problem
• A Local-Search 2-Approximation for 2-Correlation-Clustering

This page was built for publication: An Approximation Algorithm for a Semi-supervised Graph Clustering Problem