Prof. Emo Welzl and Prof. Bernd Gärtner
|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
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).
Automatic MiSe System Software Version 1.4803M | admin login