Campus Event Calendar
Event Entry
New for: D1
What and Who
Basics of Length-Constrained Expander and the existence of Low-Step Flow Shortcuts
Thatchaphol Saranurak
Assistant professor at the University of Michigan, USA.
AG1 Mittagsseminar (own work)
AG 1
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Thursday, 14 November 2024
14:00
30 Minutes
E1 5
029
Saarbrücken
Abstract
Length-constrained expander decomposition is a generalization of two powerful graph decompositions, which are low diameter decomposition and expander decomposition. This technique recently led to exciting applications including fastest approximate multi-commodity flow algorithms, deterministic dynamic distance oracles, and universal optimal distributed algorithms.
I will give a tutorial on what this object is and how to use it to find a "graph shortcut for min-cost flow", a crucial foundation for the above applications.
I will give a tutorial on what this object is and how to use it to find a "graph shortcut for min-cost flow", a crucial foundation for the above applications.
Contact
Nidhi Rathi
+49 681 9325 1134
--email hidden
Virtual Meeting Details
Zoom
897 027 2575
passcode not visible
logged in users only
Nidhi Rathi, 11/14/2024 13:32
Nidhi Rathi, 11/13/2024 12:03 -- Created document.
Nidhi Rathi, 11/13/2024 12:03 -- Created document.