Correlation clustering is a framework for partitioning the nodes of a graph according to pairwise similarity and dissimilarity labels on edges. Rather than fixing the number of clusters in advance, ...

This course studies approximation algorithms – algorithms that are used for solving hard optimization problems. Such algorithms find approximate (slightly suboptimal) solutions to optimization ...