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 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.)

Abstract Models of Optimization Problems

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)

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