Improved Approximation Algorithms for Bipartite Correlation Clustering

DOI10.1007/978-3-642-23719-5_3MaRDI QIDQ3092214zbMATH OpenOpenAlexFDO

Authors Nir Ailon, Noa Avigdor-Elgrabli, Edo Liberty, Anke van Zuylen

Publication date 16 September 2011

Published in Algorithms – ESA 2011 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-23719-5_3

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20) Approximation algorithms (68W25) Analysis of algorithms (68W40)

Recommendations

• Improved approximation algorithms for bipartite correlation clustering
• Approximation algorithms for two variants of correlation clustering problem
• An improved approximation algorithm for capacitated correlation clustering problem
• Approximation Algorithms for Biclustering Problems
• Approximation algorithms for the lower bounded correlation clustering problem
• Improved Clustering Algorithms for the Bipartite Stochastic Block Model
• Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs
• On the approximation of correlation clustering and consensus clustering
• Approximation algorithm for the balanced 2-correlation clustering problem on well-proportional graphs
• Approximation Algorithms for the Capacitated Min–Max Correlation Clustering Problem

Cited in

(3)

• Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs
• Improved approximation algorithms for bipartite correlation clustering
• Massively Parallel Correlation Clustering in Bounded Arboricity Graphs

This page was built for publication: Improved Approximation Algorithms for Bipartite Correlation Clustering

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