Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Thursday, December 02, 2010, 12:15 pm
Duration: This information is not available in the database
Location: OAT S15/S16/S17
Speaker: Ueli Peter
Given a weighted graph and a subset R of its vertices, the Steiner tree asks for a minimum-cost tree that connects the vertices in R. We discuss a new LP-based approximation algorithm by Byrka, Grandoni, Rothvoß and Sanità which improves the approximation ratio from 1.55 to 1.39 and introduces the method of randomized iterative rounding.
Automatic MiSe System Software Version 1.4803M | admin login