Explore a groundbreaking parallel algorithm for approximating shortest paths in this 26-minute ACM conference talk. Delve into the innovative approach that combines transshipment techniques with Sherman's framework and oblivious routing. Gain insights into the algorithm's efficiency and potential applications in graph theory and network optimization. Conclude with a discussion on open problems in the field, inspiring further research and development in parallel computing for shortest path approximations.
Faster Parallel Algorithm for Approximate Shortest Path
Association for Computing Machinery (ACM) via YouTube
Overview
Syllabus
Introduction
Transshipment
Sherman's framework
Oblivious routing
Open problems
Taught by
Association for Computing Machinery (ACM)
Related Courses
-
Efficient Construction of Directed Hopsets and Parallel Approximate Shortest Paths
-
Parallel Approximate Undirected Shortest Paths Via Low Hop Emulators
-
Dijkstra's Algorithm - Finding Single Source Shortest Path
-
All Pairs Shortest Path Using Dynamic Programming: Floyd-Warshall Algorithm
-
Parallel Approximate Undirected Shortest Paths Via Low Hop Emulators
-
Performance and Limitations of QAOA at Constant Levels on Large Sparse Hypergraphs and Spin Glass Models
