YoVDO

Sparsifying Set Systems for Coverage Problems

Offered By: Simons Institute via YouTube

Tags

Graph Theory Courses Data Structures Courses Computational Complexity Courses Combinatorial Optimization Courses Approximation Algorithms Courses Sublinear Algorithms Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore recent advancements in sparsifying set systems for coverage problems in this 35-minute lecture by Andrew McGregor from the University of Massachusetts Amherst. Gain insights into sublinear graph simplification techniques and their applications in solving complex coverage problems. Delve into the latest research findings and methodologies presented at the Simons Institute, enhancing your understanding of set system sparsification and its impact on algorithmic efficiency in graph theory and related fields.

Syllabus

Sparsifying Set Systems for Coverage Problems


Taught by

Simons Institute

Related Courses

Approximation Algorithms Part I
École normale supérieure via Coursera Approximation Algorithms Part II
École normale supérieure via Coursera Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
Stanford University via Coursera Algorithm Design and Analysis
University of Pennsylvania via edX Delivery Problem
University of California, San Diego via Coursera