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

Introduction to Data Science
University of Washington via Coursera Intro to Parallel Programming
Nvidia via Udacity High Performance Computing
Georgia Institute of Technology via Udacity Parallel programming
École Polytechnique Fédérale de Lausanne via Coursera Parallel Algorithms
Indian Institute of Technology Guwahati via Swayam