Explore a 25-minute IEEE conference talk that delves into the world of AdWords and online bipartite matching. Learn about the Karp, Vazirani, Vazirani 1990 algorithm, configuration LP relaxation, and the online primal-dual framework. Gain insights into the intuition behind these concepts and discover a 0.50005-competitive online primal-dual algorithm. The talk also covers hybrid algorithms and provides a comprehensive summary of AdWords in a panoramic view.
Overview
Syllabus
Intro
Online Bipartite Matching Karp, Vazirani, Vazirani 1990
Panorama View
Example
Configuration LP Relaxation
Online Primal Dual Framework
Intuition
Online Primal Dual Algorithm 0.50005-competitive
Online Primal Dual Analysis
Hybrid Algorithm
Summary
Taught by
IEEE FOCS: Foundations of Computer Science
Tags
Related Courses
-
Edge-Weighted Online Bipartite Matching
-
Online Matching with General Arrivals
-
Fully Online Matching II - Beating Ranking and Water-filling
-
STOC 2020 - Online Algorithms
-
Scheduling Precedence-Constrained Jobs on Related Machines with Communication Delay
-
Point Location and Active Learning - Learning Halfspaces Almost Optimally
