Correlation clustering with a fixed number of clusters

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2006, Pages 1167-1176

  Giotis, Ioannis ^a   Guruswami, Venkatesan ^a  

^a University of Washington   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CORRELATION CLUSTERING; DISAGREEMENTS; QUALITATIVE INFORMATION;

COMPUTATIONAL COMPLEXITY; DISTANCE MEASUREMENT; PROBLEM SOLVING;

CORRELATION METHODS;

EID: 33244494259     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1109557.1109686     Document Type: Conference Paper

References (18)

1. A. Agarwal, M. Charikar, K. Makarychev, and Y. Makarychev. O(√log n) approximation algorithms for Min Uncut, Min 2CNF deletion, and directed cut problems. In Proceedings of the 37th ACM Symposium on Theory of Computing (STOC), pages 573-581, 2005.
2. N. Ailon, M. Charikar, and A. Newman. Aggregating Inconsistent Information: Ranking and Clustering. In Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC), pages 684-693, 2005.
3. N. Alon, K. Makarychev, Y. Makarychev, and A. Naor. Quadratic forms on graphs. In Proceedings of the 37th ACM Symposium on Theory of Computing (STOC), pages 486-493, 2005.
4. S. Arora, E. Berger, E. Hazan, G. Kindler, and S. Safra. On non-approximability for quadratic programs. In Proceedings of the 46th IEEE Symposium on Foundations of Computer Science (FOCS), 2005.
5. N. Bansal, A. Blum, and S. Chawla. Correlation clustering. Machine Learning, Special Issue on Clustering, 56:89-113, 2004.
6. A. Ben-Dor, R. Shamir, and Z. Yakhini. Clustering gene expression patterns. J Comp. Biol., 6:281-97, 1999.
7. M. Charikar, V. Guruswami, and A. Wirth. Clustering with qualitative information. Journal of Computer and System Sciences, 71(3):360-383, October 2005.
8. M. Charikar and A. Wirth. Maximizing quadratic programs: extending Grothendieck's inequality. In Proceedings of the 45th IEEE Symposium on Foundations of Computer Science (FOCS), pages 54-60, 2004.
9. W. Fernandez de la Vega, M. Karpinski, C. Kenyon, and Y. Rabani. Approximation schemes for clustering problems. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC), pages 50-58, 2003.
10. W. Fernandez de la Vega and C. Kenyon. A randomized approximation scheme for metric max-cut. In Proceedings of the 39th IEEE Symposium on Foundations of Computer Science (FOCS), pages 468-471, 1998.
11. E. Demaine and N. Immorlica. Correlation clustering with partial information. In Proc. of 6th APPROX, pages 1-13, 2003.
12. D. Emanuel and A. Fiat. Correlation clustering-minimizing disagreements on arbitrary weighted graphs. In Proc. of 11th ESA, pages 208-20, 2003.
13. O. Goldreich, S. Goldwasser, and D. Ron. Property testing and its connection to learning and approximation. Journal of the ACM, 45(4):653-750, July 1998.
14. P. Indyk. A sublinear-time approximation scheme for clustering in metric spaces. In Proceedings of the 40th IEEE Symposium on Foundations of Computer Science (FOCS), pages 154-159, 1999.
15. S. Khot, G. Kindler, E. Mossel, and R. O'Donnell. Optimal inapproximability results for Max Cut and other 2-variable CSPs. In Proceedings of the 45th IEEE Symposium on Foundations of Computer Science (FOCS), pages 146-154, 2004.
16. A. Nemirovski, C. Roos, and T. Terlaky. On maximization of quadratic form over intersection of ellipsoids with common center. Mathematical Programming, 86(3):463-473, 1999.
17. R. Shamir, R. Sharan, and D. Tsur. Cluster graph modification problems. In Proc. of 28th Workshop on Graph Theory (WG), pages 379-90, 2002.
18. C. Swamy. Correlation Clustering: Maximizing agreements via semidefinite programming. In Proc. of 15th SODA, pages 519-20, 2004.