Max-Planck-Institut für Informatik
max planck institut
mpii logo Minerva of the Max Planck Society

MPI-INF or MPI-SWS or Local Campus Event Calendar

<< Previous Entry Next Entry >> New Event Entry Edit this Entry Login to DB (to update, delete)
What and Who
Title:Fast Approximate Max Flow Computation
Speaker:Christoph Lenzen
coming from:Max-Planck-Institut für Informatik - D1
Speakers Bio:
Event Type:Joint Lecture Series
Visibility:D1, D2, D3, D4, D5, SWS, RG1, MMCI
We use this to send out email in the morning.
Level:Public Audience
Date, Time and Location
Date:Wednesday, 1 July 2015
Duration:60 Minutes
Building:E1 5
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!
Name(s):Jennifer Müller
EMail:--email address not disclosed on the web
Video Broadcast
Video Broadcast:NoTo Location:
Tags, Category, Keywords and additional notes
Attachments, File(s):
Created:Jennifer Müller/MPI-INF, 02/02/2015 11:58 AM Last modified:Uwe Brahm/MPII/DE, 11/24/2016 04:13 PM
  • Jennifer Müller, 06/11/2015 09:28 AM
  • Jennifer Müller, 02/02/2015 12:00 PM -- Created document.