Approximation algorithm for correlation clustering

2009 1st International Conference on Networked Digital Technologies, NDT 2009

Volumn , Issue , 2009, Pages 140-145

  Mitra, Pinaki ^a   Samal, Mamata ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY GUWAHATI   (India)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION RATIOS; BINARY RELATIONSHIPS; CLUSTERING DATA; CORRELATION CLUSTERING; DATA POINTS; END POINTS; GEGENBAUER POLYNOMIALS; GENERAL GRAPH; GRAPH G; GRAPH-THEORETIC; IMATION; LINEAR COMBINATIONS; NP COMPLETE; OPTIMAL CLUSTERING; OPTIMIZATION PROBLEMS; POLYNOMIAL-TIME; SDP RELAXATION;

APPROXIMATION ALGORITHMS; GRAPH THEORY; OPTIMIZATION; POLYNOMIAL APPROXIMATION;

CLUSTERING ALGORITHMS;

EID: 70450163744     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/NDT.2009.5272169     Document Type: Conference Paper

References (12)

1. A. K. Jain and R. C. Dubes, Algorithms for Clustering Data. Printice Hall, 1988.
2. Nikhil Bansal and Avrim Blum and Shuchi Chawla,"Correlation clustering," in Machine Learning, 2002, pp. 238-247.
3. Moses Charikar and Venkatesan Guruswami and Anthony Wirth, "Clustering with Qualitative Information," in FOCS '03: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society, 2003, p. 524.
4. Nir Ailon and Moses Charikar and Alantha Newman,"Aggregating inconsistent information: Ranking and clustering," J. ACM, vol. 55, no. 5, pp. 1-27, 2008.
5. Erik D. Demaine and Nicole Immorlica, "Correlation clustering with partial information," in In Proceedings of the 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems. Springer, 2003, pp. 1-13.
6. Dotan Emanuel and Amos Fiat, "Correlation clustering - minimizing disagreements on arbitrary weighted graphs," in Proceedings of the 11th Annual European Symposium on Algorithms. Springer, 2003, pp. 208-220.
7. Chaitanya Swamy, "Correlation clustering: Maximizing agreements via semidefinite programming," in In SODA, 2004, pp. 519-520.
8. Ioannis Giotis and Venkatesan Guruswami, "Correlation Clustering with a Fixed Number of Clusters," Theory of Computing, vol. 2, no. 1, pp. 249-266, 2006.
9. Ron Shamir and Roded Sharan and Dekel Tsur, "Cluster graph modification problems,"in Discrete Applied Mathematics. Springer, 2002, pp. 379-390.
10. Adi Avidor and Uri Zwick, "Rounding Two and Three Dimensional Solutions of the SDP Relaxation of MAX CUT ," in In Proc. 8th APPROX, 2005, pp. 14-25.
11. Michel X. Goemans and Franz Rendl, "Semidefinite programming in combinatorial optimization," Mathematical Programming, vol. 79, pp. 143-161, 1997.
12. D. P. Williamson, "Lecture notes on Approximation Algorithms," IBM research report, Tech. Rep., Spring 1998.