LP-based pivoting algorithm for higher-order correlation clustering

DOI10.1007/s10878-018-0354-yzbMath1425.90092OpenAlexW4248950956WikidataQ129059664 ScholiaQ129059664MaRDI QIDQ5920230

Takuro Fukunaga

Publication date: 25 June 2019

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-018-0354-y

zbMATH Keywords

correlation clusteringLP-rounding algorithmcoclustering

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Extreme-point and pivoting methods (90C49)

Related Items (3)

Approximation algorithm for min-max correlation clustering problem with outliers ⋮ Approximation algorithms for the lower bounded correlation clustering problem ⋮ A literature review on correlation clustering: cross-disciplinary taxonomy with bibliometric analysis

Cites Work

• Correlation clustering
• On the hardness of approximating Multicut and Sparsest-Cut
• Correlation clustering in general weighted graphs
• Clustering with qualitative information
• Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs
• Improved Approximation Algorithms for Bipartite Correlation Clustering

This page was built for publication: LP-based pivoting algorithm for higher-order correlation clustering