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, March 29, 2007, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Yves Brise

LP-type problems, a linear time algorithm further simplified

LP-type problems are an abstract framework that includes Linear Programming and several other geometric problems, for example Smallest Enclosing Ball. In this talk, I present a linear time, three- staged procedure that has been known for some time now. The first two stages are due to Clarkson, and the last one is due to Kalai, and to Matou\u{s}ek, Sharir, and Welzl. The combination of these three stages leads to a procedure for non-degenerate LP-type problems with at most $O(d^2 n + e^{\sqrt{d \log d}})$ arithmetic operations, where $n$ is the number of constraints and $d$ is the combinatorial dimension of the problem.

My work has been mainly concerned with the second stage, in particular the simplification of the analysis by getting rid of an artificial check, that was only part of the algorithm for analytical reasons.

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