YoVDO

Online Covering: Secretaries, Prophets and Universal Maps

Offered By: Google TechTalks via YouTube

Tags

Algorithms Courses Combinatorics Courses Theoretical Computer Science Courses Competitive Analysis Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a Google TechTalk presented by Roie Levin on online covering algorithms for integer programs (IPs) with applications to secretary and prophet problems. Delve into a polynomial-time algorithm achieving an O(log mn) competitive ratio for online covering IPs with randomly ordered constraints, matching the best offline bound and overcoming known lower bounds. Discover how this result extends to the prophet version of the problem and its implications for building universal maps with limited samples. Learn about the speaker's background in algorithms for uncertain environments and submodular optimization. Gain insights into cutting-edge research in algorithms, combinatorics, and optimization presented at this Google Research Algorithm Seminar.

Syllabus

Online Covering: Secretaries, Prophets and Universal Maps


Taught by

Google TechTalks

Related Courses

Information Theory
The Chinese University of Hong Kong via Coursera Intro to Computer Science
University of Virginia via Udacity Analytic Combinatorics, Part I
Princeton University via Coursera Algorithms, Part I
Princeton University via Coursera Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Stanford University via Coursera