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, November 06, 2007, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Justus Schwartz

Computation of Lower Bounds for Steiner Trees in Road Network Design

In a collaborative project with the chair of land use engineering at ETH a heuristic has been developed for the design of road networks. The theoretical approximation guarantees of 2-2/k are not good enough as we are dealing with real world costs. Therefore good lower bounds had to be computed as evidence that the computed networks are close to optimal. In this talk I will show, after presenting the general setting and the heuristic, how the lower bounds have been obtained.

Joint work with Angelika Steger, Jürg Stückelberger and Andreas Weissl.

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