YoVDO

Maximum Matching in O(log log n) Passes in Dynamic Streams

Offered By: Simons Institute via YouTube

Tags

Graph Theory Courses Space Complexity Courses Approximation Algorithms Courses Sketching Algorithms Courses Sublinear Algorithms Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a groundbreaking lecture on approximating maximum matching in dynamic streams. Delve into a randomized sketching-based algorithm that achieves an O(1)-approximation in O(log log n) passes and O(n poly log n) space, exponentially improving the state-of-the-art. Learn about the first multi-pass lower bound for this problem, demonstrating that Ω(log log n) passes are necessary for any algorithm finding an O(1)-approximation in O(n poly log n) space. Discover how these upper and lower bounds collectively settle the pass complexity of this fundamental problem in the dynamic streaming model. Focus primarily on the algorithmic aspects of the results, including techniques to improve the approximation ratio to (1+eps)-approximation for any constant eps > 0 with asymptotically the same space and number of passes.

Syllabus

Maximum Matching in $O(\log \log n)$ Passes in Dynamic Streams


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