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: Tuesday, February 21, 2006, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Leo Rüst

Violator spaces

We define a new abstract framework for optimization problems, violator spaces, which is a proper generalization of the LP-type problems (also called generalized linear programming problems) introduced by Sharir and Welzl. LP-type problems are equivalent to acyclic violator spaces.

We show that unique sink orientations (USO) are nontrivial models for cyclic violator spaces. The consequence is that Clarkson's randomized algorithm for low-dimensional linear programming, which works in the context of violator spaces, then gives us the fastest algorithm for solving low-dimensional USO problems (such as the P-matrix generalized linear complementarity problem).

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