Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Thursday, June 10, 2004, 12:15 pm
Duration: This information is not available in the database
Location: This information is not available in the database
Speaker: Petr Škovroň (Charles Univ.)
In order to achieve better running time bounds for the linear programming, new algorithms (or new variants of old algorithms) appeared in the 90's. It was noted that some of them are applicable to a broader class of optimization problems, and an abstract framework describing the class was developed (so called LP-type problems).
In the talk I briefly review this framework. Then I show an alternative description of it (violator spaces) and some connections with other abstract models. In the end I sketch the directions of my current research.
(Joint work with Jiří Matoušek; some insights were provided by Bernd Gärtner)
Automatic MiSe System Software Version 1.4803M | admin login