YoVDO

Dynamic Approximate Shortest Paths and Beyond - Subquadratic and Worst Case Update Time

Offered By: IEEE via YouTube

Tags

Graph Algorithms Courses Data Structures Courses Computational Complexity Courses Algorithm Optimization Courses Shortest Path Algorithms Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore cutting-edge research on dynamic graph algorithms in this 20-minute IEEE conference talk by Jan van den Brand and Danupon Nanongkai. Delve into the latest advancements in dynamic approximate shortest paths, focusing on subquadratic and worst-case update time complexities. Gain insights into innovative techniques for maintaining shortest paths in rapidly changing graph structures, and discover how these algorithms can be applied to solve real-world problems efficiently.

Syllabus

Dynamic Approximate Shortest Paths and Beyond: Subquadratic and Worst Case Update Time


Taught by

IEEE FOCS: Foundations of Computer Science

Tags

Related Courses

LAFF-On Programming for High Performance
The University of Texas at Austin via edX Машинное обучение на больших данных
Higher School of Economics via Coursera Machine Learning with Javascript
Udemy Améliorez les réseaux neuronaux profonds
DeepLearning.AI via Coursera How To Build A Brand On Social Media!
Skillshare