Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Approximating Maximum Matching Requires Almost Quadratic Time

Simons Institute via YouTube

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a 24-minute lecture on approximating maximum matching in graph theory. Delve into the latest research findings presented by Mohammad Roghani from Stanford University at the Simons Institute. Learn about the challenges in estimating the size of maximum matching and the recent breakthrough by Bhattacharya, Kiss, and Saranurak. Discover how their algorithm achieves an estimate within ε n of the optimal solution in subquadratic time. Examine the gap between existing lower bounds and the potential for faster algorithms. Uncover the speaker's contribution in closing this gap, proving that the BKS algorithm is near-optimal. Gain insights into the time complexity requirements for estimating maximum matching size within specific error bounds in the adjacency list model.

Syllabus

Approximating Maximum Matching Requires Almost Quadratic Time

Taught by

Simons Institute

Reviews

Start your review of Approximating Maximum Matching Requires Almost Quadratic Time

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.