Explore recent advancements in Euclidean spanners through this 36-minute conference talk by Hung Le from the University of Massachusetts Amherst. Gain insights into sparse, light, fault-tolerant, and dynamic spanners as part of the Sublinear Graph Simplification series. Discover outstanding open problems in the field and expand your understanding of this important area in computational geometry.
Overview
Syllabus
Recent Progress on Euclidean Spanners
Taught by
Simons Institute
Related Courses
-
Truly Optimal Euclidean Spanners
-
Almost-Optimal Sublinear Additive Spanners in Graph Theory
-
On Light Spanners, Low-Treewidth Embeddings and Efficient Traversing in Minor-Free Graphs
-
Recent Progress on Sublinear Time Algorithms for Maximum Matching - Upper Bounds
-
Recent Progress on Sublinear Time Algorithms for Maximum Matching - Lower Bounds
-
Parallel Algorithms for Local Problems in Sparse Graphs
