Improved approximation algorithms for bipartite correlation clustering
DOI10.1137/110848712zbMATH Open1257.68076OpenAlexW2071234528MaRDI QIDQ4907577FDOQ4907577
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
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
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20) Approximation algorithms (68W25)
Cited In (21)
- An improved approximation algorithm for capacitated correlation clustering problem
- Faster parameterized algorithm for Bicluster Editing
- Even better fixed-parameter algorithms for bicluster editing
- A simple and improved parameterized algorithm for bicluster editing
- An improved approximation algorithm for the capacitated correlation clustering problem
- Improved Approximation Algorithms for Bipartite Correlation Clustering
- Approximation algorithm for min-max correlation clustering problem with outliers
- Massively Parallel Correlation Clustering in Bounded Arboricity Graphs
- Approximation algorithm for the balanced 2-correlation clustering problem on well-proportional graphs
- Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs
- Approximation Algorithms for the Capacitated Min–Max Correlation Clustering Problem
- LP-based pivoting algorithm for higher-order correlation clustering
- The feedback arc set problem with triangle inequality is a vertex cover problem
- Improved kernelization and fixed-parameter algorithms for bicluster editing
- New heuristics for the bicluster editing problem
- Title not available (Why is that?)
- Approximation algorithms for the capacitated correlation clustering problem with penalties
- Approximation algorithm for the capacitated correlation clustering problem with penalties
- Approximation algorithms for two variants of correlation clustering problem
- A literature review on correlation clustering: cross-disciplinary taxonomy with bibliometric analysis
- Approximation algorithms for the lower bounded correlation clustering problem
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)
