YoVDO

Sublinear Algorithms for Correlation Clustering

Offered By: Simons Institute via YouTube

Tags

Sublinear Algorithms Courses Graph Theory Courses Approximation Algorithms Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a lecture on sublinear algorithms for correlation clustering presented by Slobodan Mitrovic from UC Davis. Delve into the correlation clustering problem, which aims to cluster graph vertices to minimize between-cluster positive and within-cluster negative edges. Learn about a recent result achieving a 3+eps approximation using O(Delta/eps) LCA probes, O(log 1/eps) MPC rounds, and O(1/eps) expected update time in fully dynamic settings under oblivious adversary. Discover how this work relates to the seminal research on computing maximal independent sets in the LCA model. Gain insights into the technical analysis behind these results, based on joint work with Mina Dalirrooyfard and Konstantin Makarychev.

Syllabus

Sublinear algorithms for correlation clustering


Taught by

Simons Institute

Related Courses

Sampling-Based Sublinear Low-Rank Matrix Arithmetic Framework for Dequantizing Quantum Machine Learning
Association for Computing Machinery (ACM) via YouTube Sublinear Algorithms for Gap Edit Distance
IEEE via YouTube High Dimensional Robust Sparse Regression
Simons Institute via YouTube Learning-Augmented Sketches for Frequency Estimation
Simons Institute via YouTube Adaptive Sparse Recovery with Limited Adaptivity
Simons Institute via YouTube