Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, May 03, 2016, 12:15 pm
Duration: 30 minutes
Location: CAB G51
Speaker: Malte Milatz
We discuss how the analysis of combinatorial algorithms for linear programming can lead to rather different kinds of abstractions. We explain that a specific result for random pivoting can be proven in a very weak model (unique sink orientations) and point out some persisting challenges.
Automatic MiSe System Software Version 1.4803M | admin login