Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, June 25, 2009, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Rico Zenklusen

A Flow Model Based on (Poly-)Linking Systems

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.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login