Improved approximation algorithms for bipartite correlation clustering

DOI10.1137/110848712MaRDI QIDQ4907577zbMATH OpenOpenAlexFDO

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

Publication date 4 February 2013

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/110848712

zbMATH Keywords

approximation algorithmbipartite correlation clusteringgraph editing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20) Approximation algorithms (68W25)

Recommendations

• Improved Approximation Algorithms for Bipartite Correlation Clustering
• Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs
• A semidefinite programming rounding algorithm for correlation clustering problem
• Correlation clustering, maximizing agreements via semidefinite programming
• Algorithms - ESA 2003

Cited in

(21)

• New heuristics for the bicluster editing problem
• Even better fixed-parameter algorithms for bicluster editing
• Approximation algorithm for the balanced 2-correlation clustering problem on well-proportional graphs
• A simple and improved parameterized algorithm for bicluster editing
• A literature review on correlation clustering: cross-disciplinary taxonomy with bibliometric analysis
• Approximation algorithms for the capacitated correlation clustering problem with penalties
• An improved approximation algorithm for capacitated correlation clustering problem
• Approximation algorithm for min-max correlation clustering problem with outliers
• Approximation algorithm for the capacitated correlation clustering problem with penalties
• Approximation algorithms for two variants of correlation clustering problem
• Faster parameterized algorithm for Bicluster Editing
• Approximation algorithms for the lower bounded correlation clustering problem
• Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs
• Improved Approximation Algorithms for Bipartite Correlation Clustering
• The feedback arc set problem with triangle inequality is a vertex cover problem
• LP-based pivoting algorithm for higher-order correlation clustering
• Approximation Algorithms for the Capacitated Min–Max Correlation Clustering Problem
• Massively Parallel Correlation Clustering in Bounded Arboricity Graphs
• scientific article; zbMATH DE number 7758351 (Why is no real title available?)
• An improved approximation algorithm for the capacitated correlation clustering problem
• Improved kernelization and fixed-parameter algorithms for bicluster editing

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 Q4907577)