An approximation algorithm for a semi-supervised graph clustering problem

DOI10.1007/978-3-030-58657-7_3MaRDI QIDQ4965096zbMATH OpenOpenAlexFDO

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

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

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

Recommendations

• On a semi-supervised graph clustering problem
• 2-approximation algorithms for two graph clustering problems
• Semi-supervised graph clustering: a kernel approach
• Semi-supervised clustering
• Pairwise data clustering and applications

Cites work

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

Cited in

(2)

• 2-approximation algorithms for two graph clustering problems
• On a semi-supervised graph clustering problem

This page was built for publication: An approximation algorithm for a semi-supervised graph clustering problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4965096)