Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Thursday, June 25, 2009, 12:15 pm
Duration: This information is not available in the database
Location: CAB G51
Speaker: Rico Zenklusen
We introduce a flow model based on linking systems that generalizes several other flow models, including an information flow model for which an efficient maximum flow algorithm was recently found [Amaudruz and Fragouli, SODA'09]. The flow networks we consider have a layered structure and how flow can be sent from one layer to the next one is described by linking systems, a structure closely related to matroids. The model can be generalized to a capacitated version by using polylinking systems instead of linking systems. However, for the sake of simplicity, we only consider linking systems in the presentation. Exploiting results from matroid theory, many interesting properties can be derived. In particular we show a max-flow min-cut theorem, submodularity of cut values, and a description of the flow polytope. Furthermore, we show how to determine a maximum flow, minimum cost flow and a minimum cut in polynomial time.
Joint work with Michel Goemans and Satoru Iwata.
Automatic MiSe System Software Version 1.4803M | admin login