YoVDO

One Tree to Rule Them All: Polylogarithmic Universal Steiner Trees and Strong Sparse Partition Hierarchies

Offered By: Google TechTalks via YouTube

Tags

Graph Algorithms Courses Computer Science Courses Graph Theory Courses Combinatorial Optimization Courses Approximation Algorithms Courses Spanning Tree Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a groundbreaking Google TechTalk on universal Steiner trees (USTs) presented by D Ellis Hershkowitz. Delve into the first construction of poly-logarithmic-approximate USTs, which significantly improves previous approximation guarantees and nearly matches logarithmic lower bounds. Learn about strong sparse partition hierarchies, a new type of poly-logarithmic-quality graph hierarchy that provides deterministic guarantees on ball intersections. Discover the implications of this research for online and oblivious Steiner tree problems, and gain insights into graph algorithms, approximation techniques, and metric embeddings from an expert in the field.

Syllabus

One Tree to Rule Them All: Polylogarithmic Universal Steiner Trees


Taught by

Google TechTalks

Related Courses

Intro to Algorithms
Udacity Algorithmic Thinking (Part 1)
Rice University via Coursera Design and Analysis of Algorithms
Chennai Mathematical Institute via Swayam Capstone: Analyzing (Social) Network Data
University of California, San Diego via Coursera Algorithms on Graphs
University of California, San Diego via Coursera