A Simple (1−eps)-Approximation Adaptive Sketching Algorithm for Maximum (Weighted) Matching

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=bILurZvDaYI


Duration: 46:49
183 views
4

Sepehr Assadi (University of Waterloo and Rutgers University)
https://simons.berkeley.edu/talks/sepehr-assadi-university-waterloo-rutgers-university-2023-10-11
Sketching and Algorithm Design

In this talk, we present a simple algorithm for computing (1-eps)-approximation of weighted matching in general (not necessarily bipartite) graphs using O(log(n)/eps) rounds of adaptive sketching. This matches the performance of state-of-the-art algorithms, while being considerably simpler.

The algorithm relies on a "white-box" application of the multiplicative weight update method with a self-contained primal-dual analysis that can be of independent interest.



Other Videos By Simons Institute for the Theory of Computing


2023-10-16Model Counting Meets Distinct Estimation
2023-10-16The Intensional-Extensional Problem in Probabilistic Databases
2023-10-16Compiling FO Sentences to Circuits: Upper Bounds and Lower Bounds on the Size of the Circuit
2023-10-13Pseudorandom Hashing for Space-bounded Computation with Applications in Streaming
2023-10-13Resizable Sketches
2023-10-13A Simple Quantum Sketch With Applications to Graph Algorithms
2023-10-12Insights from Engineering Sketches for Production and Using Sketches at Scale
2023-10-12A Near-Linear Time Algorithm for the Chamfer Distance
2023-10-12Robustness of Sketches to Adaptive nputs
2023-10-12Tight Bounds for Volumetric Spanners in All Norms
2023-10-12A Simple (1−eps)-Approximation Adaptive Sketching Algorithm for Maximum (Weighted) Matching
2023-10-11Sketching Algorithms for Max-DICUT and other CSPs
2023-10-11Error Correction for Streaming Messages
2023-10-11Streaming Lower Bounds for the Needle Problems
2023-10-11Streaming Euclidean k-median and k-means with o(log n) Space
2023-10-11Capacity Analysis of Vector Symbolic Architectures
2023-10-11Improved Frequency Estimation Algorithms with and without Predictions
2023-10-11Testing Positive Semidefiniteness and Eigenvalue Approximation
2023-10-11Sketching Techniques for Kernel Density Estimation or for Optimal Transport Computations
2023-10-11Sketching and Projecting
2023-10-10Lightning Talks


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Sketching and Algorithm Design
Sepehr Assadi