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, December 16, 2004, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Kaspar Fischer

More convex programs in subexponential time

Some problems from computational geometry can be solved in subexponential time (in the real RAM model of computation). Examples include linear programming and the computation of the smallest enclosing ball (a.k.a. "miniball") of a pointset in Rd, which both can be solved in expected time O(poly(d) n eo(d)).

In this talk, I am going to explain how one can obtain subexpontential algorithms for two additional problems (distance between the convex hulls of two sets of balls, and the miniball of balls).

For this, we generalize Bernd Gärtner & Sven Schöherr's method for solving quadratic programs, and use Gärtner's subexponential algorithm for so-called "abstract optimization problems."

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