Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Mittagsseminar Talk Information |

**Date and Time**: Thursday, October 09, 2008, 12:15 pm

**Duration**: This information is not available in the database

**Location**: CAB G51

**Speaker**: Martin Jaggi

*Core-sets* have proven to be a fruitful concept for
approximation algorithms in high-dimensional geometry.
The concept has initially been proposed for the smallest enclosing
ball problem for a set of points in R^{d}. Here an
*ε-core-set* is a subset of the points, such that the
smallest enclosing ball of the core-set, blown up by (1+ε),
encloses all the points.
It was shown that here core-sets of size as small as
^{⌈}1/ε^{⌉}
do exist, can be found quite easily,
and this is optimal. It is surprising (at least to me) that this size
is not only independent of the number of points, but also independent
of the dimension d.

In this talk I will try to translate these ideas to the *polytope
distance problem*, i.e. finding the point inside a polytope which
is closest to the origin. We will see that also in this setting,
Θ(1/ε) lower and upper bounds for the core-set size can
be established, thus also independent of dimension and number of
points.

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

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