New Algorithms for Directed Spanner Problems and Generalizations
Offered By: Simons Institute via YouTube
Course Description
Overview
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
Aplicaciones de la teoría de grafos a la vida realMiríadax Aplicaciones de la Teoría de Grafos a la vida real
Universitat Politècnica de València via UPV [X] Introduction to Computational Thinking and Data Science
Massachusetts Institute of Technology via edX Genome Sequencing (Bioinformatics II)
University of California, San Diego via Coursera Algorithmic Information Dynamics: From Networks to Cells
Santa Fe Institute via Complexity Explorer