Sublinear Algorithms for Correlation Clustering
Offered By: Simons Institute via YouTube
Course Description
Overview
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
Aplicaciones de la teoría de grafos a la vida realMiríadax Aplicaciones de la Teoría de Grafos a la vida real
Universitat Politècnica de València via UPV [X] Introduction to Computational Thinking and Data Science
Massachusetts Institute of Technology via edX Genome Sequencing (Bioinformatics II)
University of California, San Diego via Coursera Algorithmic Information Dynamics: From Networks to Cells
Santa Fe Institute via Complexity Explorer