| Prof. Dr. B. Monien
Martin Gairing |
Seminar Flüsse |
| 22.06.04 | Der Zeitplan für das Blockseminar steht jetzt fest. (siehe unten) |
| Raum für das Blockseminar: F0.231 | |
| 12.05.04 | Zusatztermin: |
| Am 9.6.2004 von 16-18 Uhr halten Stefan Finke und Wolfgang Reinhardt 2 Vortraege zu: Chapter 9 aus Ahuja/Magnanti/Orlin (Minimum Cost Flows: Basic Algorithms) | |
| 19.04.04 | Als Termin für das Blockseminar wurde der 25.-26. Juni 2004 festgelegt. |
| 16:00-18:00 |
Stefan Finke, Wolfgang Reinhardt |
R.K. Ahuja, and T.L. Magnanti, and J.B. Orlin
Network flows: Theory, Algorithms, and Applications Prentice Hall, 1993 Chapter 9: Minimum Cost Flows: Basic Algorithms |
| 9:00-11:00 |
Jan Hokamp, Stefan Biermann |
R.K. Ahuja, and T.L. Magnanti, and J.B. Orlin
Network flows: Theory, Algorithms, and Applications Prentice Hall, 1993 Chapter 7: Maximum Flows: Polynomial Algorithms |
| 11:15-12:15 | Alexander Krieger |
R.K. Ahuja, and T.L. Magnanti, and J.B. Orlin
Network flows: Theory, Algorithms, and Applications Prentice Hall, 1993 Chapter 8: Maximum Flows: Additional Topics |
| 12:15-14:00 | Mittagspause | Restaurant Lahore |
| 14:00-15:00 | Falk Windheim |
Z. Galil, and A. Naamad
An O(EV log V) algorithm for the maximum flow problem Journal of Computer and System Sciences, 21:203-217,1980 |
| 15:00-16:00 | Matthias Barth |
A.V. Goldberg, and S. Rao
Beyond the Flow Decomposition Barrier Journal of the ACM, 45:783-797, 1998 |
| 16:30-17:30 | Björn Hagemeier |
Y. Dinitz, and N. Garg and, M.X. Goemans
On the Single-Source Unsplittable Flow Problem Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 290-299, 1998 |
| 17:30-18:30 | Matthias Schubert |
M. Gairing, and T. Lücking, and M. Mavronicolas, and B. Monien
Computing Nash Equilibria for Scheduling on Restricted Parallel Links Proceedings of the 36th Annual ACM Symposium on the Thoery of Computing, 2004 |
| 9:00-10:00 | Thorsten Pivl |
J.B. Orlin
A Faster Strongly Polynomial Minimum Cost Flow Algorithm Operations Research 41(2), 338-350, 1993 |
| 10:00-11:00 | Christian Todtenbier |
P.T. Sokkalingam, R.K. Ahuja, and J.B. Orlin
New polynomial-time cycle-canceling algorithms for minimum-cost flows. Networks 36(1): 53-63, 2000 |
| 11:15-12:15 | Martin Freund |
R.D. Armstrong, and Z. Jin
A new strongly polynomial dual network simplex algorithm Mathematical Programming 78, 131-148, 1997 |
| 12:15-13:15 | Ivonne Bleischwitz |
N. Devanur, and C. Papadimitriou, and A. Saberi, and V. Vazirani
Market equilibrium via a primal-dual-type algorithm Proceedings of the 43th Annual Symposium on Foundations of Computer Science, 2002 |
| R.K. Ahuja, and T.L. Magnanti, and J.B. Orlin: | Network flows: Theory, Algorithms, and Applications | Prentice Hall, 1993 |