A Local-Search 2-Approximation for 2-Correlation-Clustering

DOI10.1007/978-3-540-87744-8_26zbMath1158.68549OpenAlexW1749432580MaRDI QIDQ3541094

James Saunderson, Tom Coleman, Anthony Wirth

Publication date: 25 November 2008

Published in: Algorithms - ESA 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-87744-8_26

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation algorithms (68W25)

Related Items (12)

$2$-Approximation algorithms for two graph clustering problems ⋮ Separator-based data reduction for signed graph balancing ⋮ A modeling and computational study of the frustration index in signed networks ⋮ Graph clustering with a constraint on cluster sizes ⋮ Experimental study of semi-supervised graph 2-clustering problem ⋮ Unnamed Item ⋮ On a semi-superwized graph clustering problem ⋮ APPROXIMATE ALGORITHMS FOR GRAPH CLUSTERING PROBLEM ⋮ Unnamed Item ⋮ Correlation clustering in data streams ⋮ An Approximation Algorithm for a Semi-supervised Graph Clustering Problem ⋮ A literature review on correlation clustering: cross-disciplinary taxonomy with bibliometric analysis

This page was built for publication: A Local-Search 2-Approximation for 2-Correlation-Clustering