N. Bansal, A. Blum, and S. Chawla, Correlation Clustering, Machine Learning, pp.89-113, 2004.

U. Feige and M. X. Goemans, Approximating the value of two prover proof systems, with applications to MAX 2SAT and MAX DICUT, Proc. of 3rd Israel Symposium on the Theory of Computing and Systems, pp.182-189, 1995.

U. Feige and J. Vondrák, Approximation algorithms for allocation problems: Improving the factor of 1 - 1/e, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06), pp.667-676
DOI : 10.1109/FOCS.2006.14

D. S. Hochbaum, Approximating Covering and Packing Problems: Set Cover, Vertex Cover, Independent Set, and Related Problems, in Approximation Algorithms for NP, 1997.

A. K. Jain and R. C. Dubes, Algorithms for Clustering Data, 1981.

J. M. Kleinberg and K. Ligett, Information-Sharing and Privacy in Social Networks, p.469, 2010.

D. Livnat, M. Lewin, and U. Zwick, Improved rounding techniques for the MAX 2-SAT and MAX DI-CUT problems, pp.67-82, 2002.

V. Vazirani, Approximation algorithms, 2004.
DOI : 10.1007/978-3-662-04565-7

U. Zwick, Analyzing the MAX 2-SAT and MAX DI-CUT approximation algorithms of Feige and Goemans, currently available from http