![Bridging Continuous and Discrete Optimization_hi-res logo](/sites/default/files/styles/workshop_banner_sm_1x/public/2023-01/Bridging%20Continuous%20and%20Discrete%20Optimization_hi-res.png.jpg?itok=b7fmT0eV)
Description
The Correlation Clustering Problem
In correlation clustering, the goal is to cluster data given similarity/dissimilarity judgment about pairs of data items. A variety of associated optimization problems have been studied from the approximation algorithms viewpoint. In this talk, I will survey some of these results. We will encounter linear programming, semi-definite programming, and combinatorial techniques that have been used to attack the problem and take a random walk through several different variants of the basic problem that have been studied over the years.
All scheduled dates:
Upcoming
No Upcoming activities yet