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, January 24, 2006, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Christian Balderer

A simple approximation algorithm for Connected Facility Location

In the Connected Facility Location problem, we are given an undirected graph with edge costs and a subset D of the vertices, called the demands. The task is to open a set of connected facilities such that the sum of all shortest-path distances from a demand to its closest facility plus the cost for connecting the facilities is minimized.

We present a simple randomized approximation algorithm that achieves a factor 3.55 approxmiation, which is an improvement over the previously known bound of 4.55.

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