YoVDO

New Algorithms for Directed Spanner Problems and Generalizations

Offered By: Simons Institute via YouTube

Tags

Graph Theory Courses Network Design 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 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.

Syllabus

New algorithms for directed spanner problems and generalizations


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