Randomized Online Matching in Regular Graphs

1,727 views

About this video

Advanced · Hand-picked by a BrighterTube curator · found via round-3 back catalogue of a channel Lumen picks video by video · 82% confidence

Analyzes randomized online matching algorithms in regular graphs, a problem in algorithmic combinatorics. A research seminar presenting theoretical results on graph algorithms and approximation guarantees.

A 53-minute video from Google TechTalks: “Randomized Online Matching in Regular Graphs”.

Video by Google TechTalks, played through YouTube's embedded player.