Correlation clustering in general weighted graphs

@article{Demaine2006CorrelationCI,
  title={Correlation clustering in general weighted graphs},
  author={Erik D. Demaine and Dotan Emanuel and Amos Fiat and Nicole Immorlica},
  journal={Theor. Comput. Sci.},
  year={2006},
  volume={361},
  pages={172-187}
}
We consider the following general correlation-clustering problem [N. Bansal, A. Blum, S. Chawla, Correlation clustering, in: Proc. 43rd Annu. IEEE Symp. on Foundations of Computer Science, Vancouver, Canada, November 2002, pp. 238–250]: given a graph with real nonnegative edge weights and a 〈+〉/〈−〉 edge labelling, partition the vertices into clusters to minimize the total weight of cut 〈+〉 edges and uncut 〈−〉 edges. Thus, 〈+〉 edges with large weights (representing strong correlations between… CONTINUE READING
BETA

Citations

Publications citing this paper.
SHOWING 1-10 OF 133 CITATIONS, ESTIMATED 48% COVERAGE

275 Citations

02040'07'10'13'16'19
Citations per Year
Semantic Scholar estimates that this publication has 275 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
SHOWING 1-10 OF 26 REFERENCES

Similar Papers

Loading similar papers…