Campus Event Calendar
Event Entry
What and Who
Fast Approximate Max Flow Computation
Christoph Lenzen
MMCI
Joint Lecture Series
AG 1, AG 2, AG 3, AG 4, AG 5, SWS, RG1, MMCI
Public Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Wednesday, 1 July 2015
12:15
60 Minutes
E1 5
002
Saarbrücken
Abstract
The max flow problem is one of the most fundamental and well-studied network problems.
In this talk, I will revisit it from the perspective of distributed algorithms. For
decades, the million-dollar question here has been whether there *is* a fast distributed
algorithm or one should rather collect all information at a single location and apply an
old school centralized algorithm. On the way to answering this question, we will get to
see several of the brilliant ideas that have come up recently on this evergreen among
the classic graph problems. The talk is tailored to a general CS audience; don't worry
if you're not familiar with the topic - come to enjoy the show!
In this talk, I will revisit it from the perspective of distributed algorithms. For
decades, the million-dollar question here has been whether there *is* a fast distributed
algorithm or one should rather collect all information at a single location and apply an
old school centralized algorithm. On the way to answering this question, we will get to
see several of the brilliant ideas that have come up recently on this evergreen among
the classic graph problems. The talk is tailored to a general CS audience; don't worry
if you're not familiar with the topic - come to enjoy the show!
Contact
Jennifer Müller
2900
--email hidden
passcode not visible
logged in users only
Jennifer Müller, 06/11/2015 09:28
Jennifer Müller, 02/02/2015 12:00 -- Created document.
Jennifer Müller, 02/02/2015 12:00 -- Created document.