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: Tuesday, December 20, 2011, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Christian Lorenz Müller

The Lovasz-Vempala algorithm for computing the volume of a convex body in O*(n4) - Theory and Implementation

Volume computation of convex bodies is a problem where randomized algorithms are provably superior to deterministic ones. In the past 20 years a series of papers appeared that reduced the complexity from O*(n23) to O*(n4). The latter bound has been achieved by an algorithm proposed by Lovasz and Vempala in 2004. The algorithm can be seen as an inverse simulated annealing algorithm that heavily relies on the fast-mixing Hit-and-Run sampling scheme. This year Lovasz and Deak presented the first implementation of the algorithm as well as a number of computational results.

In this talk I will detail the working mechanisms of the Lovasz-Vempala algorithm and explain the main computational techniques necessary to arrive at an implementable 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