Completed
Removing Diameter Constraint
Class Central Classrooms beta
YouTube videos curated by Class Central.
Classroom Contents
On Light Spanners, Low-Treewidth Embeddings and Efficient Traversing in Minor-Free Graphs
Automatically move to the next video in the Classroom when playback concludes
- 1 Intro
- 2 Capacitated Vehicle Routing (CVR)
- 3 "Approximable" Instances.
- 4 "Approximable" means
- 5 Results for Subset TSP
- 6 Two techniques to design a PTAS
- 7 PTAS from Light Preservers
- 8 PTAS from Low Treewdith Embedding
- 9 The Framework
- 10 Light Preservers from Local Spanners
- 11 The rest of the talk: find L-local spanners.
- 12 Planar graph + One Vortex and D = 0(L)
- 13 Removing Diameter Constraint
- 14 Planar graph + O(1) Vortices
- 15 Tree of Clique-sums of Nearly-embed. Graphs
- 16 Open problems
