A Local-Search 2-Approximation for 2-Correlation-Clustering

  • Tom Coleman
  • James Saunderson
  • Anthony Wirth
Conference paper

DOI: 10.1007/978-3-540-87744-8_26

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5193)
Cite this paper as:
Coleman T., Saunderson J., Wirth A. (2008) A Local-Search 2-Approximation for 2-Correlation-Clustering. In: Halperin D., Mehlhorn K. (eds) Algorithms - ESA 2008. ESA 2008. Lecture Notes in Computer Science, vol 5193. Springer, Berlin, Heidelberg

Abstract

CorrelationClustering is now an established problem in the algorithms and constrained clustering communities. With the requirement that at most two clusters be formed, the minimisation problem is related to the study of signed graphs in the social psychology community, and has applications in statistical mechanics and biological networks.

Although a PTAS exists for this problem, its running time is impractical. We therefore introduce a number of new algorithms for 2CC, including two that incorporate some notion of local search. In particular, we show that the algorithm we call PASTA-toss is a 2-approximation on complete graphs.

Experiments confirm the strong performance of the local search approaches, even on non-complete graphs, with running time significantly lower than rival approaches.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Tom Coleman
    • 1
  • James Saunderson
    • 1
  • Anthony Wirth
    • 1
  1. 1.The University of Melbourne 

Personalised recommendations