Name
Abstract | ||
|---|---|---|
In this work we study the problem of Bipartite Correlation Clustering (BCC), a natural bipartite counterpart of the well studied Correlation Clustering (CC) problem. Given a bipartite graph, the objective of BCC is to generate a set of vertex-disjoint bi-cliques (clusters) which minimizes the symmetric difference to it. The best known approximation algorithm for BCC due to Amit (2004) guarantees an 11-approximation ratio. In this paper we present two algorithms. The first is an improved 4-approximation algorithm. However, like the previous approximation algorithm, it requires solving a large convex problem which becomes prohibitive even for modestly sized tasks. The second algorithm, and our main contribution, is a simple randomized combinatorial algorithm. It also achieves an expected 4-approximation factor, it is trivial to implement and highly scalable. The analysis extends a method developed by Ailon, Charikar and Newman in 2008, where a randomized pivoting algorithm was analyzed for obtaining a 3-approximation algorithm for CC. For analyzing our algorithm for BCC, considerably more sophisticated arguments are required in order to take advantage of the bipartite structure. Whether it is possible to achieve (or beat) the 4-approximation factor using a scalable and deterministic algorithm remains an open problem. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/978-3-642-23719-5_3 | SIAM J. Comput. |
DocType | Volume | Issue |
Journal | 41 | 5 |
ISSN | Citations | PageRank |
0302-9743 | 10 | 0.54 |
References | Authors | |
12 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nir Ailon | 1 | 1114 | 70.74 |
| Noa Avigdor-Elgrabli | 2 | 54 | 4.48 |
| Edo Liberty | 3 | 397 | 24.83 |
| Anke Van Zuylen | 4 | 291 | 22.10 |