Sketching Algorithms for Max-DICUT and Other CSPs

Explore the Maximum Directed Cut (Max-DICUT) problem and its significance in Constraint Satisfaction Problems (CSPs) through this one-hour lecture. Delve into sketching algorithms and lower bounds for Max-DICUT across various space regimes, and discover how these concepts extend to general CSPs. Learn about the challenges of estimating the largest directed cut in a given graph and understand its implications in the streaming setting. Gain insights into open problems in this field and their potential impact on algorithm design. This talk, presented by Santhoshini Velusamy from Toyota Technological Institute at Chicago, offers a comprehensive look at cutting-edge research in graph theory and computational complexity.