Correlation clustering with constrained cluster sizes and extended weights bounds

Gregory J. Puleo, Olgica Milenkovic

Research output: Contribution to journalArticlepeer-review

Abstract

We consider the problem of correlation clustering on graphs with constraints on both the cluster sizes and the positive and negative weights of edges. Our contributions are twofold: first, we introduce the problem of correlation clustering with bounded cluster sizes. Second, we extend the regime of weight values for which the clustering may be performed with constant approximation guarantees in polynomial time and apply the results to the bounded cluster size problem.

Original languageEnglish (US)
Pages (from-to)1857-1872
Number of pages16
JournalSIAM Journal on Optimization
Volume25
Issue number3
DOIs
StatePublished - 2015

Keywords

  • Approximation algorithms
  • Correlation clustering
  • Edge weights
  • Linear programming

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Correlation clustering with constrained cluster sizes and extended weights bounds'. Together they form a unique fingerprint.

Cite this