Explore recent advancements in directed spanner problems and their extensions in this 34-minute lecture by Elena Grigorescu from Purdue University. Delve into online and offline settings, as well as weighted and buy-at-bulk variants of these problems. Gain insights into sublinear graph simplification techniques and discover new algorithmic approaches for tackling directed spanner challenges in various contexts.
New Algorithms for Directed Spanner Problems and Generalizations
Overview
Syllabus
New algorithms for directed spanner problems and generalizations
Taught by
Simons Institute
Related Courses
-
Improved Streaming Algorithms for Max-DICUT via Local Snapshots
-
Constant Girth Approximation for Directed Graphs in Subquadratic Time
-
Sparsifying Set Systems for Coverage Problems
-
Parallel Algorithms for Local Problems in Sparse Graphs
-
Approximation Algorithms for Hard Augmentation Problems - Lecture II
