YoVDO

Faster Parallel Algorithm for Approximate Shortest Path

Offered By: Association for Computing Machinery (ACM) via YouTube

Tags

Parallel Algorithms Courses Parallel Computing Courses Algorithm Optimization Courses

Course Description

Overview

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.

Syllabus

Introduction
Transshipment
Sherman's framework
Oblivious routing
Open problems


Taught by

Association for Computing Machinery (ACM)

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