Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, June 28, 2005, 12:15 pm
Duration: This information is not available in the database
Location: This information is not available in the database
Speaker: Manuel Huber
Szemerédi's Regularity Lemma has proven to be one of the most important tools in extremal graph theory in the recent years. Furthermore since the discovery of the constructive version by Alon et al. the lemma gave rise to numerous algorithmic applications. We will present an aproximation algorithm for dense instances of MAX-Cut and show how to generalise this approach using the sparse Regularity Lemma. Finally we sketch the proof of the algorithmic version of the sparse Regularity Lemma.
Automatic MiSe System Software Version 1.4803M | admin login