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:Probevortrag
We use this to send out email in the morning.
Level:AG Audience
Date, Time and Location
Date:Tuesday, 2 June 2015
Duration:60 Minutes
Building:E1 4
This is a test run of the talk I'll be giving in the joint lecture series (and in several other places). It would be great if some of you could come and give me tips on how to improve the talk.

actual 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!

Name(s):Christoph Lenzen
Video Broadcast
Video Broadcast:NoTo Location:
Tags, Category, Keywords and additional notes
Attachments, File(s):

Christoph Lenzen, 06/01/2015 12:53 PM
Last modified:
Uwe Brahm/MPII/DE, 11/24/2016 04:13 PM
  • Christoph Lenzen, 06/01/2015 12:53 PM -- Created document.