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 M. Ghaffari, A. Steger and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, December 02, 2010, 12:15 pm

Duration: This information is not available in the database

Location: CAB G51

Speaker: Ueli Peter

Steiner Tree Approximation via Iterative Randomized Rounding

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.

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

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