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 M. Ghaffari, A. Steger and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Tuesday, November 11, 2003, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Kaspar Fischer

Khachiyan's method to approximate the smallest enclosing ellispoid

In his paper "Rounding of polytopes in the real number model of computation", Khachiyan describes a simple algorithm to find a (1+eps)-approximation to the smallest enclosing ellipsoid of a point set S in d-dimensional space.

In this talk, I present the algorithm and the convex program behind it and mention the problems we experienced when we implemented the algorithm.


Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   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