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, April 19, 2012, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Komei Fukuda

Revisiting the polyhedral redundancy removal problem

For a given system of $m$ linear inequalities in $d$ variables, the (polyhedral) redundancy removal problem is to find an equivalent non-redundant system. The problem is obviously polynomially solvable via linear programming. Yet, in practice, it is quite challenging to remove redundancies from a randomly generated system of not-so-large size, say in dimension $10$ and $1$ million inequalities, even with the best known method due to Ken Clarkson. In this talk, we use the LP complexity to measure the hardness of this problem and review Clarkson's algorithm. The open problem is as to whether there is an algorithm to beat the LP complexity of Clarkson's algorithm.

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