Campus Event Calendar
Event Entry
What and Who
The new max-flow algorithm of Goldberg and Rao
Torben Hagerup
MPI, AG1
AG1 Mittagsseminar
AG 1, AG 2
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Monday, 16 February 98
13:30
60 Minutes
46, MPI
024
Saarbrücken
Abstract
I describe a recent algorithm due to Goldberg and Rao (FOCS 1997)
for computing maximum flows in networks. I begin with describing
Dinitz' algorithm, then specialize Dinitz' algorithm to the case
of unit capacities (all of this is old material), and derive the
new algorithm of Goldberg and Rao through a simple modification.
Finally I mention a new corollary of my own.
Contact
Torben Hagerup
--email hidden
passcode not visible
logged in users only
Tags, Category, Keywords and additional notes
Algorithms, network flow
This talk will be a bit long, perhaps 50 minutes.