Improved Approximation Algorithms for Bipartite Correlation Clustering

DOI10.1137/110848712zbMath1257.68076OpenAlexW2071234528MaRDI QIDQ4907577

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

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 algorithmgraph editingbipartite correlation clustering

Mathematics Subject Classification ID

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

Related Items (16)

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 \textsc{Bicluster Editing} ⋮ New heuristics for the bicluster editing problem ⋮ Approximation Algorithms for the Capacitated Min–Max Correlation Clustering Problem ⋮ Approximation algorithms for the lower bounded correlation clustering problem ⋮ Unnamed Item ⋮ The feedback arc set problem with triangle inequality is a vertex cover problem ⋮ Even better fixed-parameter algorithms for bicluster editing ⋮ LP-based pivoting algorithm for higher-order correlation clustering ⋮ 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

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