YoVDO

Improved Streaming Algorithms for Max-DICUT via Local Snapshots

Offered By: Simons Institute via YouTube

Tags

Graph Theory Courses Approximation Algorithms Courses Constraint Satisfaction Problems Courses Sublinear Algorithms Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore advanced streaming algorithms for the Maximum Directed Cut (Max-DICUT) problem in this 45-minute lecture by Santhoshini Velusamy from Toyota Technological Institute at Chicago. Delve into the challenge of estimating the largest directed cut in a given graph and its significance in studying Constraint Satisfaction Problems (CSPs) in streaming settings. Learn about the current 4/9 approximation achieved through log space algorithms and discover more sophisticated approaches that surpass this limit using o(n) space. Examine the concept of local graph snapshots and their role in improving Max-DICUT approximations. Gain insights from joint research with Raghuvansh Saxena, Noah Singer, and Madhu Sudan, presented as part of the Sublinear Graph Simplification series at the Simons Institute.

Syllabus

Improved streaming algorithms for Max-DICUT via local snapshots


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